Pith. sign in

REVIEW

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

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 0912.5468 v2 pith:MCMWTR2I submitted 2009-12-30 cs.DM cs.DS

Jiri Fiala , Marcin Kaminski , Bernard Lidicky , Daniel Paulusma This is my paper · ORCID
classification cs.DMcs.DS
keywords graphsclaw-freeproblemwhenalreadyarbitrarilyfixedgeneral
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
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.

Discussion (0). Continue with ORCID to comment.

Pith tools