Edge-disjoint maximal planar graphs

DOI10.1016/S0012-365X(97)00095-2MaRDI QIDQ1377726zbMATH OpenFDO

Authors Sharon G. Boswell, Jamie Simpson

Publication date 26 January 1998

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0012-365X(97)00095-2

zbMATH Keywords

maximal planar graphs

Mathematics Subject Classification ID

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

Review text

\textit{L. W. Beineke} and \textit{F. Harary} [Can. J. Math. 17, 850-859 (1965; Zbl 0135.42104)] showed that there exist \(m\) edge-disjoint maximal planar graphs on a fixed set of \(6m\) vertices. The present authors extend this result to \(n\) vertices, where \(n\geq 6m\). Since the Euler identity disallows \(n< 6m-1\), the only open case is \(n= 6m-1\).

Recommendations

• The maximal size of graphs with at most \(k\) edge-disjoint paths connecting any two adjacent vertices
• scientific article; zbMATH DE number 1416474
• Publication:3487416
• scientific article; zbMATH DE number 4077266

Cites work

• Every planar graph with nine points has a nonplanar complement
• scientific article; zbMATH DE number 3877215 (Why is no real title available?)
• The Thickness of the Complete Graph

Cited in

(4)

• scientific article; zbMATH DE number 5942207 (Why is no real title available?)
• scientific article; zbMATH DE number 5943492 (Why is no real title available?)
• The Vertex-Disjoint Menger Problem in Planar Graphs
• Edge maximal C_{2k+1}-edge disjoint free graphs

This page was built for publication: Edge-disjoint maximal planar graphs

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