Detecting an induced net subdivision

DOI10.1016/j.jctb.2013.07.005zbMath1301.05331OpenAlexW2952193520MaRDI QIDQ461729

Nicolas Trotignon, Maria Chudnovsky, P. D. 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

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

Related Items (3)

Scattered packings of cycles ⋮ Detecting an induced subdivision of \(K_{4}\) ⋮ FPT and kernelization algorithms for the induced tree problem

Cites Work

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

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