1. U. Baumann, über das Erzeugen minimaler Kantenfärbungen von Graphen, in Graphentheorie und ihre Anwendungen, Päd. Hochsch. Dresden, Dresden, 1988, pp. 5–8.
2. C. Berge, A new color change to improve the coloring of a graph, Discrete Appl. Math. 24 (1989) 25–28.
3. M. Dyer, A. Flaxman, A. Frieze, and E. Vigoda, Randomly coloring sparse random graphs with fewer colors than the maximum degree, to appear in Random Structures and Algorithms.
4. A. Ehrenfeucht, V. Faber, H.A. Kierstead, A new method of proving theorems on chromatic index, Discrete Math. 52 (1984) 159–164.
5. S. Fisk, Geometric coloring theory, Adv. Math. 24 (1977) 298–340.