Reconfiguring vertex colourings of 2-trees
Open Access
- 16 December 2019
- journal article
- research article
- Published by University of Primorska Press in Ars Mathematica Contemporanea
- Vol. 17 (2) , 653-698
Abstract
Reconfiguring vertex colourings of 2-treesKeywords
This publication has 15 references indexed in Scilit:
- Reconfiguring dominating sets in some well-covered and other classes of graphsDiscrete Mathematics, 2017
- The k-Dominating GraphGraphs and Combinatorics, 2013
- Reconfiguration of list edge-colorings in a graphDiscrete Applied Mathematics, 2012
- On the complexity of reconfiguration problemsTheoretical Computer Science, 2011
- Finding Paths between graph colourings: PSPACE-completeness and superpolynomial distancesTheoretical Computer Science, 2009
- Connectedness of the graph of vertex-colouringsDiscrete Mathematics, 2008
- Graph Theory2008
- Randomly coloring sparse random graphs with fewer colors than the maximum degreeRandom Structures & Algorithms, 2006
- A very simple algorithm for estimating the number of k‐colorings of a low‐degree graphRandom Structures & Algorithms, 1995
- On strongly hamiltonian abelian group graphs1981