Quickly excluding a forest

https://doi.org/10.1016/0095-8956(91)90068-UGet rights and content
Under an Elsevier user license
open archive

Abstract

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

Cited by (0)

∗

Current address: Department of Industrial Engineering and Operations Research, Columbia University, New York, NY 10027.

†

This research was performed under a consulting agreement with Bellcore.

Copyright © 1991 Published by Elsevier Inc.