The coloring reconfiguration problem on specific graph classes

Tatsuhiko Hatanaka, Takehiro Ito, Xiao Zhou

研究成果: Conference contribution

3 被引用数 (Scopus)

抄録

We study the problem of transforming one (vertex) k-coloring of a graph into another one by changing only one vertex color assignment at a time, while at all times maintaining a k-coloring, where k denotes the number of colors. This decision problem is known to be PSPACE-complete even for bipartite graphs and any fixed constant k≥4. In this paper, we study the problem from the viewpoint of graph classes. We first show that the problem remains PSPACE-complete for chordal graphs even if the number of colors is a fixed constant. We then demonstrate that, even when the number of colors is a part of input, the problem is solvable in polynomial time for several graph classes, such as split graphs and trivially perfect graphs.

本文言語English
ホスト出版物のタイトルCombinatorial Optimization and Applications - 11th International Conference, COCOA 2017, Proceedings
編集者Meng Han, Hongwei Du, Xiaofeng Gao
出版社Springer Verlag
ページ152-162
ページ数11
ISBN(印刷版)9783319711492
DOI
出版ステータスPublished - 2017
イベント11th International Conference on Combinatorial Optimization and Applications, COCOA 2017 - Shanghai, China
継続期間: 2017 12 162017 12 18

出版物シリーズ

名前Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
10627 LNCS
ISSN(印刷版)0302-9743
ISSN(電子版)1611-3349

Other

Other11th International Conference on Combinatorial Optimization and Applications, COCOA 2017
国/地域China
CityShanghai
Period17/12/1617/12/18

ASJC Scopus subject areas

  • 理論的コンピュータサイエンス
  • コンピュータ サイエンス(全般)

フィンガープリント

「The coloring reconfiguration problem on specific graph classes」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル