2000 character limit reached
The k-in-a-path problem for claw-free graphs
Published 30 Dec 2009 in cs.DM and cs.DS | (0912.5468v2)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.
