Quickly excluding a forest

59Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

Abstract

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

Cite

CITATION STYLE

APA

Bienstock, D., Robertson, N., Seymour, P., & Thomas, R. (1991). Quickly excluding a forest. Journal of Combinatorial Theory, Series B, 52(2), 274–283. https://doi.org/10.1016/0095-8956(91)90068-U

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free