K4,4 ?e has no finite planar cover

DOI10.1002/(SICI)1097-0118(199801)27:1%3C51::AID-JGT8%3E3.0.CO;2-FzbMATH Open0892.05039OpenAlexW4244382984MaRDI QIDQ4376505FDOQ4376505

Authors: Petr Hliněný 

Publication date: 15 March 1998

Full work available at URL: https://doi.org/10.1002/(sici)1097-0118(199801)27:1%3C51::aid-jgt8%3E3.0.co;2-f

Recommendations

• Another two graphs with no planar covers
• Two graphs without planar covers
• On possible counterexamples to Negami's planar cover conjecture

zbMATH Keywords

planar graphplanar cover

Mathematics Subject Classification ID

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

Cited In (10)

• Locally injective \(k\)-colourings of planar graphs
• On possible counterexamples to Negami's planar cover conjecture
• Two graphs without planar covers
• Another approach to planar cover conjecture focusing on rotation systems
• 20 years of Negami's planar cover conjecture
• Locally constrained graph homomorphisms -- structure, complexity, and applications
• Computational complexity of covering three-vertex multigraphs
• Projective-planar double coverings of graphs
• The genus of regular languages and directed graph emulators
• Another two graphs with no planar covers

This page was built for publication: K4,4 ?e has no finite planar cover

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