Reconfiguration of colorable sets in classes of perfect graphs

Takehiro Ito, Yota Otachi

研究成果: Conference contribution

1 被引用数 (Scopus)


A set of vertices in a graph is c-colorable if the subgraph induced by the set has a proper c-coloring. In this paper, we study the problem of finding a step-by-step transformation (reconfiguration) between two c-colorable sets in the same graph. This problem generalizes the well-studied Independent Set Reconfiguration problem. As the first step toward a systematic understanding of the complexity of this general problem, we study the problem on classes of perfect graphs. We first focus on interval graphs and give a combinatorial characterization of the distance between two c-colorable sets. This gives a linear-time algorithm for finding an actual shortest reconfiguration sequence for interval graphs. Since interval graphs are exactly the graphs that are simultaneously chordal and co-comparability, we then complement the positive result by showing that even deciding reachability is PSPACE-complete for chordal graphs and for co-comparability graphs. The hardness for chordal graphs holds even for split graphs. We also consider the case where c is a fixed constant and show that in such a case the reachability problem is polynomial-time solvable for split graphs but still PSPACE-complete for co-comparability graphs. The complexity of this case for chordal graphs remains unsettled. As by-products, our positive results give the first polynomial-time solvable cases (split graphs and interval graphs) for Feedback Vertex Set Reconfiguration.

ホスト出版物のタイトル16th Scandinavian Symposium and Workshops on Algorithm Theory, SWAT 2018
編集者David Eppstein
出版社Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
出版ステータスPublished - 2018 6 1
イベント16th Scandinavian Symposium and Workshops on Algorithm Theory, SWAT 2018 - Malmo, Sweden
継続期間: 2018 6 182018 6 20


名前Leibniz International Proceedings in Informatics, LIPIcs


Other16th Scandinavian Symposium and Workshops on Algorithm Theory, SWAT 2018

ASJC Scopus subject areas

  • ソフトウェア


「Reconfiguration of colorable sets in classes of perfect graphs」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。