Kempe Equivalence of Colorings
Author:
- 20 December 2006
- book chapter
- Published by Springer Nature
- p. 287-297
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Torpid mixing of the Wang–Swendsen–Kotecký algorithm for sampling coloringsJournal of Discrete Algorithms, 2005
- Improved bounds for sampling coloringsJournal of Mathematical Physics, 2000
- Rhombic Penrose Tilings Can be 3-ColoredThe American Mathematical Monthly, 2000
- Heuristics for rapidly four-coloring large planar graphsAlgorithmica, 1991
- A new color change to improve the coloring of a graphDiscrete Applied Mathematics, 1989
- Akempic triangulations with 4 odd verticesDiscrete Mathematics, 1985
- A new method of proving theorems on chromatic indexDiscrete Mathematics, 1984
- Kempe classes and the Hadwiger ConjectureJournal of Combinatorial Theory, Series B, 1981
- Les 5-colorations d'un graphe planaire forment une classe de commutation uniqueJournal of Combinatorial Theory, Series B, 1978
- Geometric coloring theoryAdvances in Mathematics, 1977