Mixing colourings in \(2K_2\)-free graphs

DOI10.1016/j.disc.2022.113108zbMath1495.05092arXiv2108.00001OpenAlexW3187594655MaRDI QIDQ2166319

Carl Feghali, Owen Merkel

Publication date: 24 August 2022

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2108.00001

zbMATH Keywords

vertex colouringreconfigurationfrozen colouring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (1)

Reconfiguration of vertex colouring and forbidden induced subgraphs

Cites Work

• Recoloring graphs via tree decompositions
• Recolouring weakly chordal graphs and the complement of triangle-free graphs
• Reconfiguration graph for vertex colourings of weakly chordal graphs
• Reconfiguration graphs for vertex colourings of chordal and chordal bipartite graphs
• Connectedness of the graph of vertex-colourings

This page was built for publication: Mixing colourings in \(2K_2\)-free graphs