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

DOI10.1016/0012-365X(84)90001-3zbMATH Open0545.05035OpenAlexW1996335482MaRDI QIDQ797592FDOQ797592

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

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

zbMATH Keywords

subdivisionnon-planar graph

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (14)

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

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)