An Improved Sufficient Condition for Reconfiguration of List Edge-Colorings in a Tree
IEICE Transactions(2012)
摘要
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(n
2) 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 Ω(n
2) recoloring steps.
更多查看译文
关键词
sufficient condition,infinite family,n vertex,edge color assignment,improved sufficient condition,list edgecoloring,upper bound o,list edge-colorings,new sufficient condition,polynomial-time algorithm,recoloring step,upper bound,satisfiability,edge coloring
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要