%0 Journal Article %1 robertson03 %A Robertson, Neil %A Seymour, P.D %D 2003 %J Journal of Combinatorial Theory, Series B %K graph.theory planar %N 1 %P 43 - 76 %R 10.1016/S0095-8956(03)00042-X %T Graph Minors. XVI. Excluding a non-planar graph %V 89 %X This paper contains the cornerstone theorem of the series. We study the structure of graphs with no minor isomorphic to a fixed graph L, when L is non-planar. (The case when L is planar was studied in an earlier paper.) We find that every graph with no minor isomorphic to L may be constructed by piecing together in a tree-structure graphs each of which “almost” embeds in some surface in which L cannot be embedded.

@article{robertson03, abstract = {This paper contains the cornerstone theorem of the series. We study the structure of graphs with no minor isomorphic to a fixed graph L, when L is non-planar. (The case when L is planar was studied in an earlier paper.) We find that every graph with no minor isomorphic to L may be constructed by piecing together in a tree-structure graphs each of which “almost” embeds in some surface in which L cannot be embedded. }, added-at = {2015-05-14T09:15:24.000+0200}, author = {Robertson, Neil and Seymour, P.D}, biburl = {https://www.bibsonomy.org/bibtex/269c78d7250580d2e4330b4deddd7dcc8/ytyoun}, doi = {10.1016/S0095-8956(03)00042-X}, interhash = {be829e592eb231c705b560b240553759}, intrahash = {69c78d7250580d2e4330b4deddd7dcc8}, issn = {0095-8956}, journal = {Journal of Combinatorial Theory, Series B }, keywords = {graph.theory planar}, number = 1, pages = {43 - 76}, timestamp = {2015-05-14T09:15:24.000+0200}, title = {Graph Minors. XVI. Excluding a non-planar graph }, volume = 89, year = 2003 }