A planarity criterion for cubic bipartite graphs

DOI10.1016/S0012-365X(98)00090-9zbMath0957.05028OpenAlexW2081155888MaRDI QIDQ1584420

Jochen Harant, Thomas Böhme, Ingo Schiermeyer, Anja Pruchnewski

Publication date: 2 November 2000

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(98)00090-9

zbMATH Keywords

planaritypolynomial-time algorithmbipartitioncubic bipartite graphs

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Graph algorithms (graph-theoretic aspects) (05C85)

Cites Work

• Unnamed Item
• Unnamed Item
• A strengthening of the Kuratowski planarity criterion for 3-connected graphs
• A refinement of Kuratowski's theorem

This page was built for publication: A planarity criterion for cubic bipartite graphs