The List Coloring Reconfiguration Problem for Bounded Pathwidth Graphs

DOI10.1007/978-3-319-12691-3_24zbMath1431.68048arXiv1407.4235OpenAlexW2998237200MaRDI QIDQ2942408

Xiao Zhou, Tatsuhiko Hatanaka, Takehiro Ito

Publication date: 11 September 2015

Published in: Combinatorial Optimization and Applications (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Coloring of graphs and hypergraphs (05C15)

Related Items (9)

Parameterized complexity of the list coloring reconfiguration problem with graph parameters ⋮ Rerouting shortest paths in planar graphs ⋮ Reconfiguration of maximum-weight \(b\)-matchings in a graph ⋮ Parameterized complexity of optimizing list vertex-coloring through reconfiguration ⋮ The Complexity of (List) Edge-Coloring Reconfiguration Problem ⋮ Algorithms for Coloring Reconfiguration Under Recolorability Constraints ⋮ Parameterized Complexity of the List Coloring Reconfiguration Problem with Graph Parameters ⋮ Introduction to reconfiguration ⋮ Complexity of Coloring Reconfiguration under Recolorability Constraints

This page was built for publication: The List Coloring Reconfiguration Problem for Bounded Pathwidth Graphs