Detecting Induced Minors in AT-Free Graphs

DOI10.1007/978-3-642-35261-4_52zbMath1260.68174OpenAlexW1547147780MaRDI QIDQ4909566

Dieter Kratsch, Daniël Paulusma, Petr A. Golovach

Publication date: 21 March 2013

Published in: Algorithms and Computation (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph minors (05C83)

This page was built for publication: Detecting Induced Minors in AT-Free Graphs