Paths between colourings of graphs with bounded tree-width

DOI10.1016/j.ipl.2018.12.006zbMath1405.05059OpenAlexW2904825428MaRDI QIDQ1721933

Carl Feghali

Publication date: 13 February 2019

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2018.12.006

zbMATH Keywords

combinatorial problemsgraph colouringtree-widthreconfiguration graph

Mathematics Subject Classification ID

Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15) Distance in graphs (05C12)

Related Items (3)

Reconfiguring 10-colourings of planar graphs ⋮ An update on reconfiguring 10-colorings of planar graphs ⋮ Unnamed Item

Cites Work

• Partitioning graphs of bounded tree-width
• Recoloring graphs via tree decompositions
• Introduction to reconfiguration
• Reconfiguration graphs for vertex colourings of chordal and chordal bipartite graphs
• A very simple algorithm for estimating the number of k‐colorings of a low‐degree graph

This page was built for publication: Paths between colourings of graphs with bounded tree-width