K4,4 ?e has no finite planar cover

DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1097-0118(199801)27:1<51::AID-JGT8>3.0.CO;2-F" /><51::AID-JGT8>3.0.CO;2-F 10.1002/(SICI)1097-0118(199801)27:1<51::AID-JGT8>3.0.CO;2-FzbMath0892.05039OpenAlexW4244382984MaRDI QIDQ4376505

Petr Hliněný

Publication date: 15 March 1998

Full work available at URL: https://doi.org/10.1002/(sici)1097-0118(199801)27:1<51::aid-jgt8>3.0.co;2-f

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)

Related Items (6)

20 years of Negami's planar cover conjecture ⋮ Locally injective \(k\)-colourings of planar graphs ⋮ Computational complexity of covering three-vertex multigraphs ⋮ Locally constrained graph homomorphisms -- structure, complexity, and applications ⋮ Another two graphs with no planar covers ⋮ Projective-planar double coverings of graphs

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