A strengthening of the Kuratowski planarity criterion for 3-connected graphs

DOI10.1016/0012-365X(84)90001-3MaRDI QIDQ797592zbMATH OpenOpenAlexFDO

Authors Alexander Kelmans

Publication date 1984

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0012-365x(84)90001-3

zbMATH Keywords

subdivisionnon-planar graph

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10)

Recommendations

• Edges and Kuratowski Subgraphs of Non-Planar Graphs
• A refinement of Kuratowski's theorem
• scientific article; zbMATH DE number 475620
• Nonseparating cycles and planarity of graph-cells
• A planarity criterion for graphs

Cited in

(14)

• Kuratowski chains
• A planarity criterion for graphs
• Maximizing the number of \(x\)-colorings of 4-chromatic graphs
• Jordan circuits of a graph
• Non-planar cluster quivers from surface
• Cycles of length 0 modulo 4 in graphs
• A planarity criterion for cubic bipartite graphs
• Nonseparating cycles and planarity of graph-cells
• scientific article; zbMATH DE number 475620 (Why is no real title available?)
• A criterion for the planarity of a graph
• scientific article; zbMATH DE number 3987296 (Why is no real title available?)
• Graphs with \(3n-6\) edges not containing a subdivision of \(K_5\)
• A short proof and a strengthening of the Whitney 2-isomorphism theorem on graphs
• A refinement of Kuratowski's theorem

This page was built for publication: A strengthening of the Kuratowski planarity criterion for 3-connected graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q797592)