Hostname: page-component-cd9895bd7-jkksz Total loading time: 0 Render date: 2024-12-26T18:37:50.433Z Has data issue: false hasContentIssue false
  • English
  • Français

Graph Minors I: A Short Proof of the Path-width Theorem

Published online by Cambridge University Press:  12 September 2008

Reinhard Diestel
Reinhard Diestel
Affiliation:
Faculty of Mathematics, TU Chemnitz, 09107 Chemnitz, Germany
Get access Rights & Permissions [Opens in a new window]

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.

Type
Research Article
Information
Combinatorics, Probability and Computing , Volume 4 , Issue 1 , March 1995 , pp. 27 - 30
Copyright
Copyright © Cambridge University Press 1995

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

[1]Robertson, N. and Seymour, P. D. (1983) Graph minors. I. Excluding a forest. J. Combin. Theory B 35 39–61.CrossRefGoogle Scholar
[2]Bienstock, D., Robertson, N., Seymour, P. D. and Thomas, R. (1991) Quickly excluding a forest. J. Combin. Theory B 52 274–283.CrossRefGoogle Scholar