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

DOI10.4230/LIPICS.STACS.2010.2469MaRDI QIDQ3113764zbMATH OpenFDO

Authors Jiří Fiala, Marcin Kamiński, Bernard Lidický, Daniël Paulusma

Publication date 23 January 2012

Full work available at URL http://subs.emis.de/LIPIcs/frontdoor_599e.html

zbMATH Keywords

claw-free graphpolynomial-time algorithminduced path

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Paths and cycles (05C38)

Recommendations

• The \(k\)-in-a-path problem for claw-free graphs
• Induced disjoint paths in claw-free graphs
• Induced disjoint paths in claw-free graphs
• Finding induced paths of given parity in claw-free graphs
• Finding induced paths of given parity in claw-free graphs

Cited in

(9)

• Finding induced paths of given parity in claw-free graphs
• Induced disjoint paths in claw-free graphs
• Clique or hole in claw-free graphs
• The path partition conjecture is true for claw-free graphs
• scientific article; zbMATH DE number 6302876 (Why is no real title available?)
• The k-in-a-tree problem for chordal graphs
• The \(k\)-in-a-path problem for claw-free graphs
• Induced disjoint paths in claw-free graphs
• Finding induced paths of given parity in claw-free graphs

This page was built for publication: The \(k\)-in-a-path problem for claw-free graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3113764)