An improved sufficient condition for reconfiguration of list edge-colorings in a tree

Takehiro Ito, Kazuto Kawamura, Xiao Zhou

Research output: Chapter in Book/Report/Conference proceedingConference contribution

3 Citations (Scopus)

Abstract

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. Ito, Kamiński and Demaine gave a sufficient condition so that any list edge-coloring of a tree can be transformed into any other. In this paper, we give a new sufficient condition which improves the known one. Our sufficient condition is best possible in some sense. The proof is constructive, and yields a polynomial-time algorithm that finds a transformation between two given list edge-colorings of a tree with n vertices via O(n2) recoloring steps. We remark that the upper bound O(n 2) on the number of recoloring steps is tight, because there is an infinite family of instances on paths that satisfy our sufficient condition and whose reconfiguration requires Ω(n2) recoloring steps.

Original languageEnglish
Title of host publicationTheory and Applications of Models of Computation - 8th Annual Conference, TAMC 2011, Proceedings
Pages94-105
Number of pages12
DOIs
Publication statusPublished - 2011 May 13
Event8th Annual Conference on Theory and Applications of Models of Computation, TAMC 2011 - Tokyo, Japan
Duration: 2011 May 232011 May 25

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume6648 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other8th Annual Conference on Theory and Applications of Models of Computation, TAMC 2011
CountryJapan
CityTokyo
Period11/5/2311/5/25

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'An improved sufficient condition for reconfiguration of list edge-colorings in a tree'. Together they form a unique fingerprint.

Cite this