20 years of Negami's planar cover conjecture

DOI10.1007/S00373-010-0934-9MaRDI QIDQ604985zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Petr Hliněný

Publication date 12 November 2010

Published in Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00373-010-0934-9

zbMATH Keywords

graph covergraph homomorphismprojective graphssurvey

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Planar graphs; geometric and topological aspects of graph theory (05C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• On possible counterexamples to Negami's planar cover conjecture
• Two graphs without planar covers
• Another two graphs with no planar covers
• scientific article; zbMATH DE number 475601
• scientific article; zbMATH DE number 2110045

Cites work

• A kuratowski theorem for the projective plane
• A note on possible extensions of Negami's conjecture
• Another two graphs with no planar covers
• Composite planar coverings of graphs
• Enumeration of projective-planar embeddings of graphs
• Finite planar emulators for \(K_{4,5} - 4K_{2}\) and \(K_{1,2,2,2}\) and Fellows' conjecture
• Graphs on surfaces
• scientific article; zbMATH DE number 4106877 (Why is no real title available?)
• scientific article; zbMATH DE number 28051 (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
• On the parity of planar covers
• Projective-planar double coverings of graphs
• The spherical genus and virtually planar graphs
• Two graphs without planar covers

Cited in

(11)

• RAAGs in Ham
• Planar emulators conjecture is nearly true for cubic graphs
• Minor-minimal non-projective planar graphs with an internal 3-separation
• Mike Fellows: Weaving the Web of Mathematics and Adventure
• On the complexity of planar covering of small graphs
• scientific article; zbMATH DE number 475601 (Why is no real title available?)
• On possible counterexamples to Negami's planar cover conjecture
• scientific article; zbMATH DE number 2110045 (Why is no real title available?)
• Graph covers: where topology meets computer science, and simple means difficult
• Another approach to planar cover conjecture focusing on rotation systems
• \(K_{1, 2, 2, 2}\) has no \(n\)-fold planar cover for \(n<14\)

This page was built for publication: 20 years of Negami's planar cover conjecture

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