Recognition: unknown
The k-in-a-path problem for claw-free graphs
classification
💻 cs.DM
cs.DS
keywords
graphsclaw-freeproblemwhenalreadyarbitrarilyfixedgeneral
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.