Reconfiguring Independent Sets in Claw-Free Graphs
Discrete Mathematics
2014-03-04 v1 Combinatorics
Abstract
We present a polynomial-time algorithm that, given two independent sets in a claw-free graph , decides whether one can be transformed into the other by a sequence of elementary steps. Each elementary step is to remove a vertex from the current independent set and to add a new vertex (not in ) such that the result is again an independent set. We also consider the more restricted model where and have to be adjacent.
Cite
@article{arxiv.1403.0359,
title = {Reconfiguring Independent Sets in Claw-Free Graphs},
author = {Paul Bonsma and Marcin Kamiński and Marcin Wrochna},
journal= {arXiv preprint arXiv:1403.0359},
year = {2014}
}