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

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

2009-12-30

arxiv.org/abs/0912.5468v2

Computer Science

Discrete Mathematics

12 pages, 1 figure, STACS 2010

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

The k-in-a-path problem for claw-free graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The k-in-a-path problem for claw-free graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The k-in-a-path problem for claw-free graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-34171