The k-in-a-Path Problem for Claw-free Graphs
Open Access
- 10 November 2010
- journal article
- Published by Springer Nature in Algorithmica
- Vol. 62 (1-2) , 499-519
Abstract
No abstract availableKeywords
All Related Versions
This publication has 22 references indexed in Scilit:
- The three-in-a-tree problemCombinatorica, 2010
- The Four-in-a-Tree Problem in Triangle-Free GraphsGraphs and Combinatorics, 2009
- Finding induced treesDiscrete Applied Mathematics, 2009
- The strong perfect graph theoremAnnals of Mathematics, 2006
- The structure of claw-free graphs2005
- Detecting even holesJournal of Graph Theory, 2004
- Claw-free graphs — A surveyDiscrete Mathematics, 1997
- Linear-Time Representation Algorithms for Proper Circular-Arc Graphs and Proper Interval GraphsSIAM Journal on Computing, 1996
- On the complexity of testing for odd holes and induced odd pathsDiscrete Mathematics, 1991
- Recognizing claw-free perfect graphsJournal of Combinatorial Theory, Series B, 1988