# Linear transformations between colorings in chordal graphs

@inproceedings{Bousquet2019LinearTB,
title={Linear transformations between colorings in chordal graphs},
author={Nicolas Bousquet and Valentin Bartier},
booktitle={ESA},
year={2019}
}
• Published in ESA 2019
• Mathematics, Computer Science
Let $k$ and $d$ be such that $k \ge d+2$. Consider two $k$-colorings of a $d$-degenerate graph $G$. Can we transform one into the other by recoloring one vertex at each step while maintaining a proper coloring at any step? Cereceda et al. answered that question in the affirmative, and exhibited a recolouring sequence of exponential length. If $k=d+2$, we know that there exists graphs for which a quadratic number of recolorings is needed. And when $k=2d+2$, there always exists a linear… Expand

#### Figures and Topics from this paper

An Update on Reconfiguring $10$-Colorings of Planar Graphs
• Computer Science, Mathematics
• Electron. J. Comb.
• 2020
The number of colors is improved on, showing that $R_{10}(G)$ has diameter at most $8n$ for every planar graph $G$ with $n$ vertices. Expand
Building a larger class of graphs for efficient reconfiguration of vertex colouring
• Computer Science, Mathematics
• ArXiv
• 2020
It is proved that if G is a $k-colourable OAT graph then$\mathcal{R}_{k+1}(G)$is connected with diameter$O(n^2)$and polynomial time algorithms to recognize OAT graphs are given. Expand Recoloring graphs of treewidth 2 • Computer Science, Mathematics • Discret. Math. • 2021 It is proved that there always exists a linear transformation between any pair of 5colorings and this result is tight since there exist graphs of treewidth 2 and two 4-colorings such that a shortest transformation between them is quadratic. Expand Distributed recoloring of interval and chordal graphs • Computer Science • ArXiv • 2021 It is proved that, if the authors have less than 2ω colors, ω being the size of the largest clique, extra colors will be needed in the intermediate colorings of interval and chordal graphs, which improves on previous known algorithms that use ω + 2 colors for the same running times. Expand #### References SHOWING 1-10 OF 26 REFERENCES Recoloring graphs via tree decompositions • Mathematics, Computer Science • Eur. J. Comb. • 2018 It is proved that the shortest sequence between any two$(tw+2)$-colorings is at most quadratic (which is optimal up to a constant factor), a problem left open in Bonamy et al. (2012). Expand Fast Recoloring of Sparse Graphs • Mathematics, Computer Science • Eur. J. Comb. • 2016 In this paper, we show that for every graph of maximum average degree bounded away from$d$, any$(d+1)$-coloring can be transformed into any other one within a polynomial number of vertexExpand A Reconfigurations Analogue of Brooks' Theorem and Its Consequences • Mathematics, Computer Science • J. Graph Theory • 2016 This work shows an analogue of Brooks' Theorem by proving that from any$k-colouring, $k>\Delta$, a $\Delta$-colours of G can be obtained by a sequence of $O(n^2) recolourings using only the original$k$colours. Expand Improved Bounds for Randomly Sampling Colorings via Linear Programming • Computer Science, Mathematics • SODA • 2019 Two approaches are used to give two proofs that the Glauber dynamics is rapidly mixing for any$k\ge\left(\frac{11}{6} - \epsilon_0\right)\Delta$for some absolute constant$k > 2 \Delta\$. Expand
A polynomial version of Cereceda's conjecture
• Computer Science, Mathematics
• ArXiv
• 2019
It is proved that the diameter of the k-reconfiguration graph of a d-degenerate graph is O(n d+1) for k ≥ d + 2, and it is shown that the 5-re configuration graph of planar bipartite graphs has quadratic diameter, confirming Cereceda's conjecture for this class of graphs. Expand
Finding Paths Between 3-Colourings
• Mathematics, Computer Science
• IWOCA
• 2008
Given a 3-colorable graph G together with two proper vertex 3-colorings α and β of G, consider the following question: is it possible to transform α into β by recoloring vertices of G one at a time,Expand
Finding Paths between graph colourings: PSPACE-completeness and superpolynomial distances
• Computer Science, Mathematics
• Theor. Comput. Sci.
• 2009
It is proved that the graph GN,k is PSPACE-complete for all k = 4, even for bipartite graphs, as well as for: (i) planar graphs and 4 ≤ k ≤ 6, and (ii) bipartites planar graph and k = 2, and the values of k in k in these cases are tight. Expand
Reconfiguration of graphs with connectivity constraints
• Mathematics, Computer Science
• WAOA
• 2018
This paper is interested in multigraphs realizing a degree sequence S and such that all the sets of a nested collection $$\mathcal {CC}$$ induce connected subgraphs. Expand
Reconfiguration graphs for vertex colourings of chordal and chordal bipartite graphs
• Computer Science, Mathematics
• J. Comb. Optim.
• 2014
It is proved that for each k≥2 there is a k-colourable chordal graph G whose reconfiguration graph of the (k+1)-colourings has diameter Θ(|V|2). Expand
Mixing graph colourings
This thesis investigates some problems related to graph colouring, or, more precisely, graph re-colouring. Informally, the basic question addressed can be phrased as follows. Suppose one is given aExpand