Recolouring weakly chordal graphs and the complement of triangle-free graphs

DOI10.1016/j.disc.2021.112708zbMath1485.05067arXiv2106.11087OpenAlexW3212280926MaRDI QIDQ2065883

Owen Merkel

Publication date: 13 January 2022

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

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

zbMATH Keywords

vertex coloringreconfigurationweakly chordal graphs

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (2)

Mixing colourings in \(2K_2\)-free graphs ⋮ Reconfiguration of vertex colouring and forbidden induced subgraphs

Cites Work

• The strong perfect graph theorem
• Recoloring graphs via tree decompositions
• 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
• Normal hypergraphs and the perfect graph conjecture

This page was built for publication: Recolouring weakly chordal graphs and the complement of triangle-free graphs