The coloring reconfiguration problem on specific graph classes

DOI10.1007/978-3-319-71150-8_15zbMath1470.05056OpenAlexW2768703699MaRDI QIDQ1699776

Xiao Zhou, Tatsuhiko Hatanaka, Takehiro Ito

Publication date: 26 February 2018

Full work available at URL: https://doi.org/10.1007/978-3-319-71150-8_15

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (5)

Parameterized complexity of the list coloring reconfiguration problem with graph parameters ⋮ Parameterized complexity of optimizing list vertex-coloring through reconfiguration ⋮ Characterizing circular colouring mixing for pq<4 $\frac{p}{q}\lt 4$ ⋮ Reconfiguration of Spanning Trees with Many or Few Leaves ⋮ Using contracted solution graphs for solving reconfiguration problems

This page was built for publication: The coloring reconfiguration problem on specific graph classes