A refinement of Kuratowski's theorem

DOI10.1016/0095-8956(84)90057-1zbMath0549.05024OpenAlexW1998192166MaRDI QIDQ800369

Carsten Thomassen

Publication date: 1984

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0095-8956(84)90057-1

zbMATH Keywords

Kuratowski's theoremcycle with crossing chordsplanarity criterion

Mathematics Subject Classification ID

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

Related Items (8)

Convex grid drawings of planar graphs with constant edge-vertex resolution ⋮ Unnamed Item ⋮ Strictly-convex drawings of 3-connected planar graphs ⋮ Topological minors in line graphs -- a proof of Zha's conjecture ⋮ On colorability of graphs with forbidden minors along paths and circuits ⋮ Convex grid drawings of planar graphs with constant edge-vertex resolution ⋮ A planarity criterion for cubic bipartite graphs ⋮ Cycles of length 0 modulo 4 in graphs

Cites Work

• Unnamed Item
• Planarity and duality of finite and infinite graphs
• Non-separating induced cycles in graphs
• In abstrakten Graphen vorhandene vollständige 4‐Graphen und ihre Unterteilungen
• Kuratowski's theorem
• Efficient Planarity Testing

This page was built for publication: A refinement of Kuratowski's theorem