Graph minors. V. Excluding a planar graph

@article{Robertson1986GraphMV,
  title={Graph minors. V. Excluding a planar graph},
  author={N. Robertson and P. Seymour},
  journal={J. Comb. Theory, Ser. B},
  year={1986},
  volume={41},
  pages={92-114}
}
  • N. Robertson, P. Seymour
  • Published 1986
  • Mathematics, Computer Science
  • J. Comb. Theory, Ser. B
  • We prove that for every planar graph H there is a number w such that every graph with no minor isomorphic to H can be constructed from graphs with at most w vertices, by piecing them together in a tree structure. This has several consequences; for example, it implies that: (i) if A is a set of graphs such that no member is isomorphic to a minor of another, and some member of A is planar, then A is finite; (ii) for every fixed planar graph H there is a polynomial time algorithm to test if an… CONTINUE READING
    617 Citations

    Topics from this paper

    Paper Mentions

    Obtaining a Planar Graph by Vertex Deletion
    • 39
    • PDF
    On the presence of disjoint subgraphs of a specified type
    • 92
    Graph Minors. XVI. Excluding a non-planar graph
    • 300
    • PDF
    Packing and covering immersion-expansions of planar sub-cubic graphs
    • 4
    • Highly Influenced
    • PDF
    Obtaining a Planar Graph by Vertex Deletion
    • 35
    • PDF
    Shortcutting Planar Digraphs
    • M. Thorup
    • Mathematics, Computer Science
    • Comb. Probab. Comput.
    • 1995
    • 34
    List-coloring graphs without subdivisions and without immersions
    • 8
    • PDF
    Sparse Covers for Planar Graphs and Graphs that Exclude a Fixed Minor
    • 3
    • PDF
    Nonrepetitive Graph Coloring
    • 26

    References

    SHOWING 1-10 OF 15 REFERENCES
    Graph minors. I. Excluding a forest
    • 536
    Graph Minors. II. Algorithmic Aspects of Tree-Width
    • 1,512
    Ein Planaritltskriterium fur endliche Graphen
    • Elem. Moth
    • 1982
    On the division of graphs to connected subgraphs, Combinatorics
    • Colloq. Math. Sot. .kinos Bolyni
    • 1978
    A homology theory for spanning tress of a graph
    • 128
    A Hellytype problem in trees , in “ Combinatorial Theory and Its Applications II
    • Proc . Colloq . Balatonfured
    • 1974
    A characterisation of rigid circuit graphs
    • P. Buneman
    • Mathematics, Computer Science
    • Discret. Math.
    • 1974
    • 356
    LEHEL, A Helly-type problem in trees, in “Combinatorial Theory and Its Applications II,
    • (Proc. Colloq. Balatonfured,
    • 1969