Paths between colourings of graphs with bounded tree-width
type: Item
instance of: scholarly article
title: Paths between colourings of graphs with bounded tree-width
zbMATH Open document ID: 1405.05059
author: Carl Feghali
published in: Information Processing Letters
publication date: 2019-02-13T00:00:00Z
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C38
Mathematics Subject Classification ID: 05C12
zbMATH DE Number: 7021529
zbMATH Keywords: combinatorial problems
zbMATH Keywords: reconfiguration graph
zbMATH Keywords: graph colouring
zbMATH Keywords: tree-width
MaRDI profile type: Publication
full work available at URL: j.ipl.2018.12.006
OpenAlex ID: W2904825428
cites work: Recoloring graphs via tree decompositions
cites work: Reconfiguration graphs for vertex colourings of chordal and chordal bipartite graphs
cites work: Partitioning graphs of bounded tree-width
cites work: A very simple algorithm for estimating the number of k‐colorings of a low‐degree graph
cites work: Introduction to reconfiguration
DOI: 10.1016/J.IPL.2018.12.006
description: scientific article; zbMATH DE number 7021529