A one-dimensional Whitney trick and Kuratowski's graph planarity criterion

DOI10.1007/BF02773426zbMath0733.57001MaRDI QIDQ809409

Karanbir Singh Sarkaria

Publication date: 1991

Published in: Israel Journal of Mathematics (Search for Journal in Brave)

zbMATH Keywords

simplicial complexplanarity criteriavan Kampen obstruction

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Relations of low-dimensional topology with graph theory (57M15)

Related Items (10)

Bad drawings of small complete graphs ⋮ Crossing numbers and rotation numbers of cycles in a plane immersed graph ⋮ Homology classification of spatial embeddings of a graph ⋮ On the embeddability of skeleta of spheres ⋮ On approximability by embeddings of cycles in the plane. ⋮ A polynomial-time algorithm to find a linkless embedding of a graph ⋮ Planar diagrams for local invariants of graphs in surfaces ⋮ A deleted product criterion for approximability of maps by embeddings ⋮ Open problems on graphs arising from geometric topology ⋮ The van Kampen obstruction and its relatives

Cites Work

• Unnamed Item
• Obstructions to the imbedding of a complex in a euclidean space. I: The first obstruction
• Plongements de polyedres dans le domaine metastable
• Kuratowski complexes
• Periodic transformations of complexes
• The self-intersections of a smooth \(n\)-manifold in \(2n\)-space
• Non-Separable and Planar Graphs
• Drei Sätze über die n-dimensionale euklidische Sphäre
• Homology of Deleted Products in Dimension One
• Some Results Concerning the Structure of Graphs

This page was built for publication: A one-dimensional Whitney trick and Kuratowski's graph planarity criterion