Reconfiguration graph for vertex colourings of weakly chordal graphs

MaRDI QIDQ6621198

Carl Feghali, Jiří Fiala

Publication date: 18 October 2024

Published in: Acta Mathematica Universitatis Comenianae. New Series (Search for Journal in Brave)

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cites Work

• A dichotomy theorem for circular colouring reconfiguration
• The strong perfect graph theorem
• Fast recoloring of sparse graphs
• Finding paths between graph colourings: PSPACE-completeness and superpolynomial distances
• Mixing 3-colourings in bipartite graphs
• Recoloring graphs via tree decompositions
• Optimizing weakly triangulated graphs
• Introduction to reconfiguration
• Reconfiguration graphs for vertex colourings of chordal and chordal bipartite graphs
• Connectedness of the graph of vertex-colourings
• A reconfigurations analogue of Brooks' theorem and its consequences
• The complexity of change
• Finding paths between 3-colorings

This page was built for publication: Reconfiguration graph for vertex colourings of weakly chordal graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6621198)