Kempe equivalent list colorings revisited
From MaRDI portal
Publication:6606328
DOI10.1002/JGT.23142zbMATH Open1547.05086MaRDI QIDQ6606328FDOQ6606328
Reem Mahmoud, Carl Feghali, Dibyayan Chakraborty
Publication date: 16 September 2024
Published in: Journal of Graph Theory (Search for Journal in Brave)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Kempe classes and the Hadwiger conjecture
- Les 5-colorations d'un graphe planaire forment une classe de commutation unique
- A new Kempe invariant and the (non)-ergodicity of the Wang–Swendsen–Kotecký algorithm
- On a conjecture of Mohar concerning Kempe equivalence of regular graphs
- In most 6-regular toroidal graphs all 5-colorings are Kempe equivalent
- Kempe equivalence of 4‐critical planar graphs
- Ergodicity of the Wang–Swendsen–Kotecký algorithm on several classes of lattices on the torus
- Kempe equivalent list colorings
- 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)
