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