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

Jiri Fiala, Marcin Kaminski, Bernard Lidicky +1

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 tim…