We use cookies to ensure that we give you the best experience on our website. By continuing to browse this repository, you give consent for essential cookies to be used. You can read more about our Privacy and Cookie Policy.

Durham Research Online
You are in:

Finding induced paths of given parity in claw-free graphs.

Hof van 't, P. and Kaminski, M. and Paulusma, Daniel (2009) 'Finding induced paths of given parity in claw-free graphs.', in Graph-theoretic concepts in computer science. Berlin: Springer, pp. 341-352. Lecture notes in computer science. (5911).


The Parity Path problem is to decide if a given graph G contains both an odd length and an even length induced path between two specified vertices s and t. In the related problems Odd Induced Path and Even Induced Path, the goal is to determine whether an induced path of odd, respectively even, length between two specified vertices exists. Although all three problems are NP-complete in general, we show that they can be solved in O(n^5) time for the class of claw-free graphs. Two vertices s and t form an even pair in G if every induced path from s to t in G has even length. Our results imply that the problem of deciding if two specified vertices of a claw-free graph form an even pair, as well as the problem of deciding if a given claw-free graph has an even pair, can be solved in O(n^5) time and O(n^7) time, respectively. We also show that we can decide in O(n^7) time whether a claw-free graph has an induced cycle of given parity through a specified vertex.

Item Type:Book chapter
Additional Information:35th International Workshop, WG 2009, Montpellier, France, 24-26 June 2009 ; revised papers.
Full text:Full text not available from this repository.
Publisher Web site:
Date accepted:No date available
Date deposited:No date available
Date of first online publication:December 2009
Date first made open access:No date available

Save or Share this output

Look up in GoogleScholar