AbstractWe define graphs Yn such that none of these Yn has a minor isomorphic to K8 and for every number k and surface S not all of these graphs are in the completion of k-vertex extensions of graphs embeddable in S. This disproves a corresponding conjecture of N. Robertson and P. D. Symour [in “Progress in Graph Theory” (J. Adian Bondy and U. S. R. Murty, Eds.), pp. 399–406, Academic Press, San Diego/Toronto, 1984]
AbstractAt the core of the Robertson–Seymour theory of graph minors lies a powerful structure theore...
AbstractLet Ks,t∗ denote the graph obtained from Ks,t by adding all edges between the s vertices of ...
A planar graph is a graph that can be drawn in such a way in the plane, so that no edges cross each ...
AbstractThis paper contains the cornerstone theorem of the series. We study the structure of graphs ...
We prove that for every planar graph $X$ of treedepth $h$, there exists a positive integer $c$ such ...
AbstractA graph H is a minor of a graph G if H can be obtained from a subgraph of G by contracting e...
AbstractA graph H is a minor of a graph G if H can be obtained from a subgraph of G by contracting e...
This dissertation solves two problems relating to the structure of graphs. The first of these is mot...
AbstractWe prove that for every planar graph H there is a number w such that every graph with no min...
AbstractWe prove that for any infinite set of graphs of bounded genus, some member of the set is iso...
AbstractTwo graphs are minor-equivalent if each is isomorphic to a minor of the other. In this paper...
AbstractThe “tree-width” of a graph is defined and it is proved that for any fixed planar graph H, e...
AbstractWe give a simple proof of the fact (which follows from the Robertson–Seymour theory) that a ...
AbstractTutte's wheels theorem states that the k-spoked wheel graphs, Wk, are the basic building blo...
AbstractLet κ be an infinite cardinal, and let H be either a complete graph with κ vertices, or a tr...
AbstractAt the core of the Robertson–Seymour theory of graph minors lies a powerful structure theore...
AbstractLet Ks,t∗ denote the graph obtained from Ks,t by adding all edges between the s vertices of ...
A planar graph is a graph that can be drawn in such a way in the plane, so that no edges cross each ...
AbstractThis paper contains the cornerstone theorem of the series. We study the structure of graphs ...
We prove that for every planar graph $X$ of treedepth $h$, there exists a positive integer $c$ such ...
AbstractA graph H is a minor of a graph G if H can be obtained from a subgraph of G by contracting e...
AbstractA graph H is a minor of a graph G if H can be obtained from a subgraph of G by contracting e...
This dissertation solves two problems relating to the structure of graphs. The first of these is mot...
AbstractWe prove that for every planar graph H there is a number w such that every graph with no min...
AbstractWe prove that for any infinite set of graphs of bounded genus, some member of the set is iso...
AbstractTwo graphs are minor-equivalent if each is isomorphic to a minor of the other. In this paper...
AbstractThe “tree-width” of a graph is defined and it is proved that for any fixed planar graph H, e...
AbstractWe give a simple proof of the fact (which follows from the Robertson–Seymour theory) that a ...
AbstractTutte's wheels theorem states that the k-spoked wheel graphs, Wk, are the basic building blo...
AbstractLet κ be an infinite cardinal, and let H be either a complete graph with κ vertices, or a tr...
AbstractAt the core of the Robertson–Seymour theory of graph minors lies a powerful structure theore...
AbstractLet Ks,t∗ denote the graph obtained from Ks,t by adding all edges between the s vertices of ...
A planar graph is a graph that can be drawn in such a way in the plane, so that no edges cross each ...