20 years of Negami's planar cover conjecture

DOI10.1007/s00373-010-0934-9zbMath1218.05134OpenAlexW1964923292WikidataQ28109450 ScholiaQ28109450MaRDI QIDQ604985

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

surveygraph homomorphismgraph coverprojective graphs

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)

Related Items

Mike Fellows: Weaving the Web of Mathematics and Adventure ⋮ Graph covers: where topology meets computer science, and simple means difficult ⋮ RAAGs in Ham ⋮ Unnamed Item ⋮ Planar emulators conjecture is nearly true for cubic graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Finite planar emulators for \(K_{4,5} - 4K_{2}\) and \(K_{1,2,2,2}\) and Fellows' conjecture
• Enumeration of projective-planar embeddings of graphs
• The spherical genus and virtually planar graphs
• Composite planar coverings of graphs
• Projective-planar double coverings of graphs
• Another two graphs with no planar covers
• On the parity of planar covers
• A kuratowski theorem for the projective plane
• K4,4 ?e has no finite planar cover
• On possible counterexamples to Negami's planar cover conjecture
• A note on possible extensions of Negami's conjecture
• Two graphs without planar covers