The k-in-a-path problem for claw-free graphs
Discrete Mathematics
2016-12-15 v2 Data Structures and Algorithms
Abstract
Testing whether there is an induced path in a graph spanning k given vertices is already NP-complete in general graphs when k=3. We show how to solve this problem in polynomial time on claw-free graphs, when k is not part of the input but an arbitrarily fixed integer.
Keywords
Cite
@article{arxiv.0912.5468,
title = {The k-in-a-path problem for claw-free graphs},
author = {Jiri Fiala and Marcin Kaminski and Bernard Lidicky and Daniel Paulusma},
journal= {arXiv preprint arXiv:0912.5468},
year = {2016}
}
Comments
12 pages, 1 figure, STACS 2010