作者: Neil Robertson , P.D Seymour
DOI: 10.1016/S0095-8956(03)00042-X
关键词: Mathematics 、 Outerplanar graph 、 Planar graph 、 Graph minor 、 Combinatorics 、 Polyhedral graph 、 Universal graph 、 Robertson–Seymour theorem 、 Discrete mathematics 、 Butterfly graph 、 Forbidden graph characterization
摘要: This paper contains the cornerstone theorem of series. We study structure graphs with no minor isomorphic to a fixed graph L, when L is non-planar. (The case planar was studied in an earlier paper.) find that every may be constructed by piecing together tree-structure each which "almost" embeds some surface cannot embedded.