Mixing Homomorphisms, Recolorings, and Extending Circular Precolorings
Mixing Homomorphisms, Recolorings, and Extending Circular Precolorings
Abstract This work brings together ideas of mixing graph colorings, discrete homotopy, and precoloring extension. A particular focus is circular colorings. We prove that all the ācolorings of a graph G can be obtained by successively recoloring a single vertex provided along the lines of Cereceda, van den Heuvel, and ā¦