Quickly excluding a forest
From MaRDI portal
Publication:1179478
DOI10.1016/0095-8956(91)90068-UzbMath0763.05023WikidataQ29037364 ScholiaQ29037364MaRDI QIDQ1179478
Bienstock, Daniel, Neil Robertson, Robin Thomas, P. D. Seymour
Publication date: 26 June 1992
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
05C05: Trees
Related Items
Graph Minors I: A Short Proof of the Path-width Theorem, A simple linear-time algorithm for finding path-decompositions of small width, Excluding infinite minors, Upper bounds on the size of obstructions and intertwines, A partial k-arboretum of graphs with bounded treewidth, Call routing and the ratcatcher, On interval routing schemes and treewidth, Fugitive-search games on graphs and related parameters, On computing graph minor obstruction sets, Excluding Subdivisions of Infinite Cliques, Excluding Infinite Trees
Cites Work