Kempe classes and the Hadwiger conjecture
From MaRDI portal
(Redirected from Kempe classes and the Hadwiger conjecture)
Cites work
- Bemerkungen zu Hadwigers Vermutung
- Every planar map is four colorable. I: Discharging
- Homomorphieeigenschaften und mittlere Kantendichte von Graphen
- scientific article; zbMATH DE number 3518832 (Why is no real title available?)
- scientific article; zbMATH DE number 3241107 (Why is no real title available?)
- scientific article; zbMATH DE number 3102312 (Why is no real title available?)
- In abstrakten Graphen vorhandene vollständige 4‐Graphen und ihre Unterteilungen
- Les 5-colorations d'un graphe planaire forment une classe de commutation unique
Cited in
(21)- On a conjecture of Mohar concerning Kempe equivalence of regular graphs
- In most 6-regular toroidal graphs all 5-colorings are Kempe equivalent
- Introduction to reconfiguration
- Distributed recoloring
- The \(a\)-graph coloring problem
- Ergodicity of the Wang–Swendsen–Kotecký algorithm on several classes of lattices on the torus
- Kempe equivalence of colourings of cubic graphs
- Diameter of colorings under Kempe changes
- Kempe equivalence of colourings of cubic graphs
- Kempe equivalence of 4‐critical planar graphs
- Kempe equivalence of almost bipartite graphs
- Kempe equivalent list edge-colorings of planar graphs
- On a recolouring version of Hadwiger's conjecture
- Strengthening a Theorem of Meyniel
- Kempe changes in degenerate graphs
- Kempe equivalent list colorings revisited
- Kempe classes and almost bipartite graphs
- Kempe equivalence of 4-colorings of graphs on non-orientable surfaces
- Kempe equivalence classes of cubic graphs embedded on the projective plane
- On a recolouring version of Hadwiger's conjecture (extended abstract)
- A survey on the parameterized complexity of reconfiguration problems
This page was built for publication: Kempe classes and the Hadwiger conjecture
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1157337)
