Reconfiguration of list edge-colorings in a graph

@article{Ito2009ReconfigurationOL,
  title={Reconfiguration of list edge-colorings in a graph},
  author={Takehiro Ito and Marcin Kaminski and Erik D. Demaine},
  journal={Discrete Applied Mathematics},
  year={2009},
  volume={160},
  pages={2199-2207}
}
We study the problem of reconfiguring one list edge-coloring of a graph into another list edge-coloring by changing only one edge color assignment at a time, while at all times maintaining a list edge-coloring, given a list of allowed colors for each edge. First we show that this problem is PSPACE-complete, even for planar graphs of maximum degree 3 and just six colors. We then consider the problem restricted to trees. We show that any list edge-coloring can be transformed into any other under… CONTINUE READING

Citations

Publications citing this paper.
SHOWING 1-10 OF 52 CITATIONS, ESTIMATED 81% COVERAGE

On the Complexity of Reconfiguration of Clique, Cluster Vertex Deletion, and Dominating Set

VIEW 22 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

Introduction to Reconfiguration

VIEW 3 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

The Complexity of (List) Edge-Coloring Reconfiguration Problem

VIEW 4 EXCERPTS
CITES BACKGROUND & METHODS

Using Contracted Solution Graphs for Solving Reconfiguration Problems

VIEW 2 EXCERPTS
CITES BACKGROUND
HIGHLY INFLUENCED

Reconfiguration over Tree Decompositions

VIEW 9 EXCERPTS
CITES METHODS
HIGHLY INFLUENCED

On k-total dominating graphs S .

  • Alikhani D. Fatehi
  • 2019
VIEW 1 EXCERPT
CITES BACKGROUND

Using contracted solution graphs for solving reconfiguration problems

VIEW 1 EXCERPT
CITES BACKGROUND

FILTER CITATIONS BY YEAR

2008
2019

CITATION STATISTICS

  • 4 Highly Influenced Citations

References

Publications referenced by this paper.
SHOWING 1-10 OF 13 REFERENCES

On the complexity of reconfiguration problems

VIEW 1 EXCERPT

Games

  • R. A. Hearn, E. D. Demaine
  • Puzzles, and Computation, A K Peters
  • 2009
VIEW 3 EXCERPTS

Reconfiguration of list edge-colorings in a graph

  • T. Ito, M. Kamiński, E. D. Demaine
  • in: F. Dehne, M. Gavrilova, J.-R. Sack, C.D. Tóth (Eds.), WADS 2009, in: LNCS, vol. 5664, Springer, Heidelberg
  • 2009
VIEW 1 EXCERPT

J

  • L. Cereceda
  • van den Heuvel, M. Johnson, Finding paths between 3-colourings, in: Proc. of IWOCA 2008
  • 2008
VIEW 2 EXCERPTS