Quickly excluding a forest

Dan Bienstock, Neil Robertson, Paul Seymour, Robin Thomas

Research output: Contribution to journalArticle

63 Scopus citations

Abstract

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

Original languageEnglish (US)
Pages (from-to)274-283
Number of pages10
JournalJournal of Combinatorial Theory, Series B
Volume52
Issue number2
DOIs
StatePublished - Jul 1991
Externally publishedYes

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Discrete Mathematics and Combinatorics
  • Computational Theory and Mathematics

Fingerprint Dive into the research topics of 'Quickly excluding a forest'. Together they form a unique fingerprint.

  • Cite this