Kempe classes and the Hadwiger conjecture

DOI10.1016/S0095-8956(81)80014-7zbMath0471.05028OpenAlexW2091869630MaRDI QIDQ1157337

Michel Las Vergnas, Henri Meyniel

Publication date: 1981

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0095-8956(81)80014-7

zbMATH Keywords

planar graphHadwiger indexKempe chromatic number

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)

Related Items (14)

In most 6-regular toroidal graphs all 5-colorings are Kempe equivalent ⋮ Kempe equivalence of 4‐critical planar graphs ⋮ Kempe equivalent list edge-colorings of planar graphs ⋮ On a recolouring version of Hadwiger's conjecture ⋮ Strengthening a Theorem of Meyniel ⋮ Unnamed Item ⋮ Kempe equivalence of colourings of cubic graphs ⋮ On a conjecture of Mohar concerning Kempe equivalence of regular graphs ⋮ The \(a\)-graph coloring problem ⋮ Kempe equivalence of colourings of cubic graphs ⋮ Diameter of colorings under Kempe changes ⋮ Distributed Recoloring ⋮ Introduction to reconfiguration ⋮ Ergodicity of the Wang–Swendsen–Kotecký algorithm on several classes of lattices on the torus

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Bemerkungen zu Hadwigers Vermutung
• Les 5-colorations d'un graphe planaire forment une classe de commutation unique
• Every planar map is four colorable. I: Discharging
• Homomorphieeigenschaften und mittlere Kantendichte von Graphen
• In abstrakten Graphen vorhandene vollständige 4‐Graphen und ihre Unterteilungen

This page was built for publication: Kempe classes and the Hadwiger conjecture