Reconfiguration of list edge-colorings in a graph

Takehiro Ito, Marcin Kamiski, Erik D. Demaine

研究成果: Article査読

45 被引用数 (Scopus)

抄録

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 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( n2) 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 Ω( n2) recolor steps.

本文言語English
ページ(範囲)2199-2207
ページ数9
ジャーナルDiscrete Applied Mathematics
160
15
DOI
出版ステータスPublished - 2012 10

ASJC Scopus subject areas

  • 離散数学と組合せ数学
  • 応用数学

フィンガープリント

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

引用スタイル