The k-in-a-path Problem for Claw-free Graphs

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.

• Type: Conference
• Year: 2010
• Where: STACS
• Authors: Jirí Fiala, Marcin Kaminski, Bernard Lidický, Daniël Paulusma
• Keywords: General Graphs, Induced Path, Polynomial Time, STACS 2010, Theoretical Computer Science