Abstract
We study the problem of transforming one (vertex) ccoloring of a graph into another one by changing only one vertex color assignment at a time, while at all times maintaining a c-coloring, where c denotes the number of colors. This decision problem is known to be PSPACE-complete even for bipartite graphs and any fixed constant c ≥ 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 c is a fixed constant. We then demonstrate that, even when c is a part of input, the problem is solvable in polynomial time for several graph classes, such as k-trees with any integer k ≥ 1, split graphs, and trivially perfect graphs.
Original language | English |
---|---|
Pages (from-to) | 423-429 |
Number of pages | 7 |
Journal | IEICE Transactions on Information and Systems |
Volume | E102D |
Issue number | 3 |
DOIs | |
Publication status | Published - 2019 Mar 1 |
Keywords
- Chordal graphs
- Combinatorial reconfiguration
- Graph algorithm
- Graph coloring
- PSPACE-complete
ASJC Scopus subject areas
- Software
- Hardware and Architecture
- Computer Vision and Pattern Recognition
- Electrical and Electronic Engineering
- Artificial Intelligence