Reconfiguration of Colorable Sets in Classes of Perfect Graphs

by   Takehiro Ito, et al.

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.


page 1

page 2

page 3

page 4


Computing Subset Feedback Vertex Set via Leafage

Chordal graphs are characterized as the intersection graphs of subtrees ...

The Perfect Matching Reconfiguration Problem

We study the perfect matching reconfiguration problem: Given two perfect...

Structural Parameterizations of Budgeted Graph Coloring

We introduce a variant of the graph coloring problem, which we denote as...

Complexity of Maker-Breaker Games on Edge Sets of Graphs

We initiate the study of the algorithmic complexity of Maker-Breaker gam...

Thinness and its variations on some graph families and coloring graphs of bounded thinness

Interval graphs and proper interval graphs are well known graph classes,...

Exactly Hittable Interval Graphs

Given a set system 𝒳 = {𝒰,𝒮}, where 𝒰 is a set of elements and 𝒮 is a se...

Flip distances between graph orientations

Flip graphs are a ubiquitous class of graphs, which encode relations ind...

Please sign up or login with your details

Forgot password? Click here to reset