A planarity criterion for cubic bipartite graphs

DOI10.1016/S0012-365X(98)00090-9zbMATH Open0957.05028OpenAlexW2081155888MaRDI QIDQ1584420FDOQ1584420

Authors: Jochen Harant, T. Böhme, Anja Pruchnewski, Ingo Schiermeyer 

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

Recommendations

• Odd \(K_{3,3}\) subdivisions in bipartite graphs
• Maximum bipartite subgraphs of cubic triangle-free planar graphs
• On non-planarity of cubic graphs
• Packing and covering odd cycles in cubic plane graphs with small faces
• Finding an odd \(K_{3,3}\)

zbMATH Keywords

bipartitionpolynomial-time algorithmplanaritycubic bipartite graphs

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• A refinement of Kuratowski's theorem
• A strengthening of the Kuratowski planarity criterion for 3-connected graphs

Cited In (9)

• Odd \(K_{3,3}\) subdivisions in bipartite graphs
• A new invariant of plane bipartite cubic graphs
• Deciding whether a planar graph has a cubic subgraph is NP-complete
• On measures of nonplanarity of cubic graphs
• A characterization of planar partial cubes
• Maximum bipartite subgraphs of cubic triangle-free planar graphs
• On non-planarity of cubic graphs
• Title not available (Why is that?)
• Title not available (Why is that?)

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

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