Induced Disjoint Paths in Claw-Free Graphs

DOI10.1007/978-3-642-33090-2_45zbMath1365.05279OpenAlexW2099990859MaRDI QIDQ2912870

Daniël Paulusma, Erik Jan van Leeuwen, Petr A. Golovach

Publication date: 25 September 2012

Published in: Algorithms – ESA 2012 (Search for Journal in Brave)

Full work available at URL: http://dro.dur.ac.uk/14155/1/14155.pdf

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Paths and cycles (05C38) Structural characterization of families of graphs (05C75) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (4)

Induced disjoint paths in circular-arc graphs in linear time ⋮ Parameterized complexity of induced graph matching on claw-free graphs ⋮ Induced Disjoint Paths in Claw-Free Graphs ⋮ Claw-Free $t$-Perfect Graphs Can Be Recognized in Polynomial Time

This page was built for publication: Induced Disjoint Paths in Claw-Free Graphs