Abstract
Robertson and Seymour proved that excluding any fixed forest F as a minorimposes a bound on the path-width of a graph. We give a short proof of this, reobtaining the best possible bound of |F| – 2.
Publisher
Cambridge University Press (CUP)
Subject
Applied Mathematics,Computational Theory and Mathematics,Statistics and Probability,Theoretical Computer Science
Cited by
11 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献