Recursive characterization of maximal bipartite planar graphs

DOI10.1016/J.DAM.2025.08.032MaRDI QIDQ6906716zbMATH OpenFDO

Authors Metrose Metsidik, Helin Gong

Publication date 4 November 2025

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

Full work available at URL https://doi.org/10.1016/J.DAM.2025.08.032

zbMATH Keywords

bipartite graphsbipartite-minormaximal bipartite planar graphsplanar graphs

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites work

• Bipartite and Eulerian minors
• Bipartite minors
• Euler and bipartite matroids
• Eulerian and even-face ribbon graph minors
• Excluded minors and the ribbon graphs of knots
• Graph minors. XX: Wagner's conjecture
• Graph theory
• scientific article; zbMATH DE number 3259770 (Why is no real title available?)
• Ribbon graph minors and low-genus partial duals
• Über eine Eigenschaft der ebenen Komplexe

This page was built for publication: Recursive characterization of maximal bipartite planar graphs

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