Skip to main content
Article thumbnail
Location of Repository

The k-in-a-path problem for claw-free graphs.

By J. Fiala, M. Kaminski, B. Lidicky and Daniel Paulusma

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

Topics: Induced path, Claw-free graph, Polynomial-time algorithm.
Publisher: Dagstuhl
Year: 2010
DOI identifier: 10.4230/LIPIcs.STACS.2010.2469
OAI identifier: oai:dro.dur.ac.uk.OAI2:7432

Suggested articles


To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.