Reconfiguration of list edge-colorings in a graph

Takehiro Ito, Marcin Kamiński, Erik D. Demaine

研究成果: Conference contribution

18 被引用数 (Scopus)


We study the problem of reconfiguring one list edge-coloring of a graph into another list edge-coloring by changing one edge color 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. Then we consider the problem restricted to trees. We show that any list edge-coloring can be transformed into any other under the sufficient condition that the number of allowed colors for each edge is strictly larger than the degrees of both its endpoints. This sufficient condition is best possible in some sense. Our proof yields a polynomial-time algorithm that finds a transformation between two given list edge-colorings of a tree with n vertices using O(n 2) recolor steps. This worst-case bound is tight: we give an infinite family of instances on paths that satisfy our sufficient condition and whose reconfiguration requires Ω(n 2) recolor steps.

ホスト出版物のタイトルAlgorithms and Data Structures - 11th International Symposium, WADS 2009, Proceedings
出版ステータスPublished - 2009
イベント11th International Symposium on Algorithms and Data Structures, WADS 2009 - Banff, AB, Canada
継続期間: 2009 8 212009 8 23


名前Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
5664 LNCS


Other11th International Symposium on Algorithms and Data Structures, WADS 2009
CityBanff, AB

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

フィンガープリント 「Reconfiguration of list edge-colorings in a graph」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。