Quickly excluding a forest

Abstract We prove that for every forest F , every graph with no minor isomorphic to F has path-width at most | V ( F )| −2.

[1]  Paul D. Seymour,et al.  Monotonicity in Graph Searching , 1991, J. Algorithms.

[2]  Paul D. Seymour,et al.  Graph minors. I. Excluding a forest , 1983, J. Comb. Theory, Ser. B.

[3]  Christos H. Papadimitriou,et al.  Interval graphs and seatching , 1985, Discret. Math..

[4]  Paul D. Seymour,et al.  Graph minors. X. Obstructions to tree-decomposition , 1991, J. Comb. Theory, Ser. B.

[5]  Christos H. Papadimitriou,et al.  Searching and Pebbling , 1986, Theor. Comput. Sci..