Quickly excluding a forest

Dan Bienstock; Neil Robertson; Paul Seymour; Robin Thomas

doi:10.1016/0095-8956(91)90068-U

Quickly excluding a forest

Dan Bienstock, Neil Robertson, Paul Seymour, Robin Thomas

Research output: Contribution to journal › Article › peer-review

83 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 language	English (US)
Pages (from-to)	274-283
Number of pages	10
Journal	Journal of Combinatorial Theory, Series B
Volume	52
Issue number	2
DOIs	https://doi.org/10.1016/0095-8956(91)90068-U
State	Published - Jul 1991
Externally published	Yes

All Science Journal Classification (ASJC) codes

Theoretical Computer Science
Discrete Mathematics and Combinatorics
Computational Theory and Mathematics

Access to Document

10.1016/0095-8956(91)90068-U

Cite this

@article{53dae5311f494666a8edafb887767fca,

title = "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.",

author = "Dan Bienstock and Neil Robertson and Paul Seymour and Robin Thomas",

year = "1991",

month = jul,

doi = "10.1016/0095-8956(91)90068-U",

language = "English (US)",

volume = "52",

pages = "274--283",

journal = "Journal of Combinatorial Theory, Series B",

issn = "0095-8956",

publisher = "Academic Press Inc.",

number = "2",

}

TY - JOUR

T1 - Quickly excluding a forest

AU - Bienstock, Dan

AU - Robertson, Neil

AU - Seymour, Paul

AU - Thomas, Robin

PY - 1991/7

Y1 - 1991/7

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

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

UR - http://www.scopus.com/inward/record.url?scp=0007207982&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0007207982&partnerID=8YFLogxK

U2 - 10.1016/0095-8956(91)90068-U

DO - 10.1016/0095-8956(91)90068-U

M3 - Article

AN - SCOPUS:0007207982

SN - 0095-8956

VL - 52

SP - 274

EP - 283

JO - Journal of Combinatorial Theory, Series B

JF - Journal of Combinatorial Theory, Series B

IS - 2

ER -

Quickly excluding a forest

Abstract

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this