Tree-width and planar minors

Bienstock, 1991, Quickly excluding a forest, J. Combin. Theory Ser. B, 52, 274, 10.1016/0095-8956(91)90068-U Chekuri Diestel, 1999, Highly connected sets and the excluded grid theorem, J. Combin. Theory Ser. B, 75, 61, 10.1006/jctb.1998.1862 Ding, 2001, Spanning trees with many leaves, J. Graph Theory, 37, 189, 10.1002/jgt.1013 Kawarabayashi, 2012, Linear min–max relation between the treewidth of H-minor-free graphs and its largest grid minor, 278 Leaf, 2012 Robertson, 1986, Graph minors. V. Excluding a planar graph, J. Combin. Theory Ser. B, 41, 92, 10.1016/0095-8956(86)90030-4 Robertson, 2009, Graph minors. XXI. Graphs with unique linkages, J. Combin. Theory Ser. B, 99, 583, 10.1016/j.jctb.2008.08.003 Robertson, 1994, Quickly excluding a planar graph, J. Combin. Theory Ser. B, 62, 323, 10.1006/jctb.1994.1073 Seymour, 1993, Graph searching, and a min–max theorem for tree-width, J. Combin. Theory Ser. B, 58, 22, 10.1006/jctb.1993.1027