Another two graphs with no planar covers

DOI10.1002/JGT.1018MaRDI QIDQ2746205zbMATH OpenOpenAlexFDO

Authors Petr Hliněný

Publication date 11 September 2002

Published in Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/jgt.1018

zbMATH Keywords

conjecture of Negamiplanar coverprojective plane

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Covering spaces and low-dimensional topology (57M10)

Review text

In 1986 Negami conjectured that a connected graph has a finite planar cover if and only if it imbeds in the projective plane. (Familiar examples include the icosahedron double covering the complete graph \(K_6\) in the projective plane and, dually, the dodecahedron double covering the Petersen graph.) The graph \(K_{1,2,2,2}\) does not embed in the projective plane. If it could be shown that this graph does not have a finite planar cover, then Negami's conjecture would follow. But that question is open. In the present paper the author shows that two nonprojective graphs related to \(K_{1,2,2,2}\) (by replacing either two vertex-disjoint triangles, or four edge-disjoint triangles, not incident with the vertex of degree 6, with cubic vertices) have no planar covers. This result is used in a subsequent paper to limit the number of possible counterexamples to the conjecture of Negami.

Recommendations

• Two graphs without planar covers
• scientific article; zbMATH DE number 4106877
• scientific article; zbMATH DE number 4110709
• Nonplanar graphs and well-covered cycles
• scientific article; zbMATH DE number 20622
• Planar graphs having no proper 2-immersions in the plane. II
• Another characterisation of planar graphs
• Cycle covers of planar 2-edge-connected graphs
• On 2-fold covers of graphs
• On two dual classes of planar graphs

Cites work

• 103 graphs that are irreducible for the projective plane
• A kuratowski theorem for the projective plane
• K4,4 ?e has no finite planar cover
• The spherical genus and virtually planar graphs

Cited in

(15)

• The spherical genus and virtually planar graphs
• Composite planar coverings of graphs
• Projective-planar double coverings of graphs
• On the complexity of planar covering of small graphs
• scientific article; zbMATH DE number 4106877 (Why is no real title available?)
• scientific article; zbMATH DE number 475599 (Why is no real title available?)
• scientific article; zbMATH DE number 475601 (Why is no real title available?)
• K4,4 ?e has no finite planar cover
• On possible counterexamples to Negami's planar cover conjecture
• Two graphs without planar covers
• scientific article; zbMATH DE number 2110045 (Why is no real title available?)
• 20 years of Negami's planar cover conjecture
• Another approach to planar cover conjecture focusing on rotation systems
• \(K_{1, 2, 2, 2}\) has no \(n\)-fold planar cover for \(n<14\)
• Nonplanar graphs and well-covered cycles

This page was built for publication: Another two graphs with no planar covers

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