The complexity of change

@inproceedings{Heuvel2013TheCO,
  title={The complexity of change},
  author={Jan van den Heuvel},
  booktitle={Surveys in Combinatorics},
  year={2013}
}
Many combinatorial problems can be formulated as “Can I transform configuration 1 into configuration 2, if certain transformations only are allowed?”. An example of such a question is: given two k-colourings of a graph, can I transform the first k-colouring into the second one, by recolouring one vertex at a time, and always maintaining a proper k-colouring… CONTINUE READING