On the diameter of reconfiguration graphs for vertex colourings
- 1 December 2011
- journal article
- Published by Elsevier in Electronic Notes in Discrete Mathematics
- Vol. 38, 161-166
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- On the complexity of reconfiguration problemsTheoretical Computer Science, 2011
- Finding paths between 3-coloringsJournal of Graph Theory, 2010
- Finding Paths between graph colourings: PSPACE-completeness and superpolynomial distancesTheoretical Computer Science, 2009
- Mixing 3-colourings in bipartite graphsEuropean Journal of Combinatorics, 2009
- The Connectivity of Boolean Satisfiability: Computational and Structural DichotomiesSIAM Journal on Computing, 2009
- The intersection graphs of subtrees in trees are exactly the chordal graphsJournal of Combinatorial Theory, Series B, 1974