Kempe equivalent list colorings revisited
From MaRDI portal
Publication:6606328
Recommendations
Cites work
- scientific article; zbMATH DE number 5130739 (Why is no real title available?)
- scientific article; zbMATH DE number 3735847 (Why is no real title available?)
- scientific article; zbMATH DE number 3232667 (Why is no real title available?)
- A new Kempe invariant and the (non)-ergodicity of the Wang–Swendsen–Kotecký algorithm
- Ergodicity of the Wang–Swendsen–Kotecký algorithm on several classes of lattices on the torus
- In most 6-regular toroidal graphs all 5-colorings are Kempe equivalent
- Kempe classes and the Hadwiger conjecture
- Kempe equivalence of 4‐critical planar graphs
- Kempe equivalent list colorings
- Les 5-colorations d'un graphe planaire forment une classe de commutation unique
- On a conjecture of Mohar concerning Kempe equivalence of regular graphs
- On a recolouring version of Hadwiger's conjecture
This page was built for publication: Kempe equivalent list colorings revisited
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6606328)