Graph minors. V. Excluding a planar graph by Robertson, Seymour

https://www.doi.org/10.1016/0095-8956(86)90030-4

@article{RobertsonSymour1986V,
author = {Neil Robertson and P.D Seymour},
doi = {10.1016/0095-8956(86)90030-4},
issn = {0095-8956},
journaltitle = {Journal of Combinatorial Theory, Series B},
number = {1},
pages = {92-114},
title = {Graph minors. V. Excluding a planar graph},
volume = {41},
year = {1986},
}

page 2 : excluded planar minor upper bounds treewidth by a constant – (1.5) For every planar graph $H$, there is a number $w$ such that every planar graph with no minor isomorphic to $H$ has tree-wdtih $\le w$