Detecting an induced net subdivision

DOI10.1016/J.JCTB.2013.07.005MaRDI QIDQ461729zbMATH OpenOpenAlexFDO

Authors Maria Chudnovsky, Nicolas Trotignon, Paul Seymour

Publication date 13 October 2014

Published in Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jctb.2013.07.005

zbMATH Keywords

polynomial-time algorithm

Mathematics Subject Classification ID

Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

• Detecting an induced subdivision of \(K_{4}\)
• Detecting an induced subdivision of K₄

Cites work

• Graph minors. XIII: The disjoint paths problem
• The three-in-a-tree problem

Cited in

(5)

• Detecting an induced subdivision of \(K_{4}\)
• FPT and kernelization algorithms for the induced tree problem
• Scattered packings of cycles
• Detecting an induced subdivision of K₄
• Induced disjoint paths without an induced minor

This page was built for publication: Detecting an induced net subdivision

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