Output details

Finding paths between 3-colorings

<13>This is one from a pair of papers that represent the initiation of the rapidly proliferating study of the structure of the solution graphs of combinatorial problems now known as reconfiguration problems. For example, Richard C. Brewster and Jonathan A. Noel, Mixing Homomorphisms and Extending Circular Colourings (not yet published) cites this paper as the motivation for the study of similar problems on graph homomorphisms (a generalisation of colourings), and also demonstrates that our proof techniques have broader application. The results also find applications in unrelated areas such as Parallel Computing; see Iain A. Stewart: On the Computational Complexity of Routing in Faulty k-ary n-Cubes and Hypercubes. Parallel Processing Letters 22(1): (2012).