Jun 7, 2019 · 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 ...

Feb 19, 2018 · In this paper, we study the problem of finding a step-by-step transformation (reconfiguration) between two c-colorable sets in the same graph.

Jun 4, 2018 · In this paper, we study the problem of finding a step-by-step transformation (reconfiguration) between two c-colorable sets in the same graph.

Feb 19, 2018 · Abstract. A set of vertices in a graph is c-colorable if the subgraph induced by the set has a proper c-coloring.

This paper studies the problem of finding a step-by-step transformation between two c-colorable sets in the same graph and gives the first polynomial-time ...

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, w...

In this paper, we study the problem of finding a step-by-step transformation (called a reconfiguration sequence) between two c-colorable sets in the same graph.

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 ...

Fingerprint. Dive into the research topics of 'Reconfiguration of colorable sets in classes of perfect graphs'. Together they form a unique fingerprint.

Aug 13, 2018 · Bibliographic details on Reconfiguration of Colorable Sets in Classes of Perfect Graphs.