Les 5-colorations d'un graphe planaire forment une classe de commutation unique

DOI10.1016/0095-8956(78)90042-4zbMath0385.05035OpenAlexW1987563301MaRDI QIDQ1249187

Henri Meyniel

Publication date: 1978

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

Full work available at URL: https://doi.org/10.1016/0095-8956(78)90042-4

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (12)

In most 6-regular toroidal graphs all 5-colorings are Kempe equivalent ⋮ Kempe equivalence of 4‐critical planar graphs ⋮ On a recolouring version of Hadwiger's conjecture ⋮ Strengthening a Theorem of Meyniel ⋮ Kempe classes and the Hadwiger conjecture ⋮ 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 ⋮ Introduction to reconfiguration ⋮ Ergodicity of the Wang–Swendsen–Kotecký algorithm on several classes of lattices on the torus

Cites Work

• Combinatorial structure on triangulations. I: The structure of four colorings
• Unnamed Item

This page was built for publication: Les 5-colorations d'un graphe planaire forment une classe de commutation unique