Recoloring via modular decomposition (2405.06446v2)
Abstract: The reconfiguration graph of the $k$-colorings of a graph $G$, denoted $R_{k}(G)$, is the graph whose vertices are the $k$-colorings of $G$ and two colorings are adjacent in $R_{k}(G)$ if they differ in color on exactly one vertex. A graph $G$ is said to be recolorable if $R_{\ell}(G)$ is connected for all $\ell \geq \chi(G)$+1. We demonstrate how to use the modular decomposition of a graph class to prove that the graphs in the class are recolorable. In particular, we prove that every ($P_5$, diamond)-free graph, every ($P_5$, house, bull)-free graph, and every ($P_5$, $C_5$, co-fork)-free graph is recolorable. A graph is prime if it cannot be decomposed by modular decomposition except into single vertices. For a prime graph $H$, we study the complexity of deciding if $H$ is $k$-colorable and the complexity of deciding if there exists a path between two given $k$-colorings in $R_{k}(H)$. Suppose $\mathcal{G}$ is a hereditary class of graphs. We prove that if every blowup of every prime graph in $\mathcal{G}$ is recolorable, then every graph in $\mathcal{G}$ is recolorable.
- M. Belavadi and K. Cameron. Recoloring some hereditary graph classes. Available at https://arxiv.org/abs/2312.00979, 2024.
- Reconfiguration of vertex colouring and forbidden induced subgraphs. European Journal of Combinatorics 118, paper no. 103908, 2024.
- Building a larger class of graphs for efficient reconfiguration of vertex colouring. In J. Nešetřil, G. Perarnau, J. Rué, and O. Serra, editors, Extended Abstracts EuroComb 2021, pages 286–292, Cham, 2021. Springer International Publishing.
- M. Bonamy and N. Bousquet. Recoloring graphs via tree decompositions. European Journal of Combinatorics 69, 200–213, 2018.
- Reconfiguration graphs for vertex colourings of chordal and chordal bipartite graphs. Journal of Combinatorial Optimization 27, 132–143, 2014.
- P. Bonsma and L. Cereceda. Finding paths between graph colourings: PSPACE-completeness and superpolynomial distances. Theoretical Computer Science 410, 5215–5226, 2009.
- A. Brandstädt. (P5subscript𝑃5P_{5}italic_P start_POSTSUBSCRIPT 5 end_POSTSUBSCRIPT, diamond)-free graphs revisited: structure and linear time optimization. Discrete Applied Mathematics 138, 13–27, 2004.
- Finding paths between 3-colourings. Proceedings of the 19th International Workshop on Combinatorial Algorithms, IWOCA, 182-–196, 2008.
- A recursive linear time modular decomposition algorithm via LexBFS. Available at https://arxiv.org/abs/0710.3901, 2024.
- C. Feghali and J. Fiala. Reconfiguration graph for vertex colourings of weakly chordal graphs. Discrete Mathematics 343(3), paper no. 111733, 2020.
- C. Feghali and O. Merkel. Mixing colourings in 2K22subscript𝐾22K_{2}2 italic_K start_POSTSUBSCRIPT 2 end_POSTSUBSCRIPT-free graphs. Discrete Mathematics 345(11), paper no. 113108, 2022.
- J. L. Fouquet. A decomposition for a class of (P5subscript𝑃5P_{5}italic_P start_POSTSUBSCRIPT 5 end_POSTSUBSCRIPT, P5¯¯subscript𝑃5\overline{P_{5}}over¯ start_ARG italic_P start_POSTSUBSCRIPT 5 end_POSTSUBSCRIPT end_ARG)-free graphs. Discrete Mathematics 121, 75–83, 1993.
- J. L. Fouquet and V. Giakoumakis. On semi-P4subscript𝑃4P_{4}italic_P start_POSTSUBSCRIPT 4 end_POSTSUBSCRIPT-sparse graphs. Discrete Mathematics 165/166, 277–300, 1997.
- J. L. Fouquet and J. M. Vanherpe. Seidel complementation on (P5subscript𝑃5P_{5}italic_P start_POSTSUBSCRIPT 5 end_POSTSUBSCRIPT, house, bull)-free graphs. Available at https://arxiv.org/abs/1003.5458, 2010.
- Chính T. Hoàng. On the structure of (banner, odd hole)-free graphs. Journal of Graph Theory 89, 395–412, 2018.
- B. Jamison and S. Olariu. A tree representation for P4subscript𝑃4P_{4}italic_P start_POSTSUBSCRIPT 4 end_POSTSUBSCRIPT-sparse graphs. Discrete Applied Mathematics 35, 115–129, 1992.
- O. Merkel. Recolouring weakly chordal graphs and the complement of triangle-free graphs. Discrete Mathematics 345, paper no. 112708, 2022.
- M. Wrochna. Reconfiguration in bounded bandwidth and tree-depth. Journal of Computer and System Sciences 93, 1–10, 2018.