Add to ORKGThere are sixteen 3-connected graphs on eleven or fewer edges. For each of these graphs H we discuss the structure of graphs that do not contain a minor isomorphic to H. © 2012 Elsevier B.V. All rights reserved
AbstractAt the core of the Robertson–Seymour theory of graph minors lies a powerful structure theore...
Jorgensen conjectured that every 6-connected graph with no K-6 minor has a vertex whose deletion mak...
An exact structure is described to classify the projective‐planar graphs that do not contain a K3, 4...
AbstractThere are sixteen 3-connected graphs on eleven or fewer edges. For each of these graphs H we...
AbstractThere are sixteen 3-connected graphs on eleven or fewer edges. For each of these graphs H we...
This dissertation solves two problems relating to the structure of graphs. The first of these is mot...
AbstractAt the core of the Robertson–Seymour theory of graph minors lies a powerful structure theore...
AbstractTutte's wheels theorem states that the k-spoked wheel graphs, Wk, are the basic building blo...
AbstractThis paper contains the cornerstone theorem of the series. We study the structure of graphs ...
A graph H is a minor of another graph G, denoted by $H\ {\prec\sb{m}}\ G,$ if a graph isomorphic to ...
A graph H is a minor of another graph G, denoted by $H\ {\prec\sb{m}}\ G,$ if a graph isomorphic to ...
AbstractLet ν(G) be the graph invariant introduced by Colin de Verdière in J. Combin. Theory Ser. B....
AbstractA graph is a minor of another if the first can be obtained from a subgraph of the second by ...
A graph G contains a graph H as a pivot-minor if H can be obtained from G by applying a sequence of ...
AbstractWe prove that for every planar graph H there is a number w such that every graph with no min...
AbstractAt the core of the Robertson–Seymour theory of graph minors lies a powerful structure theore...
Jorgensen conjectured that every 6-connected graph with no K-6 minor has a vertex whose deletion mak...
An exact structure is described to classify the projective‐planar graphs that do not contain a K3, 4...
AbstractThere are sixteen 3-connected graphs on eleven or fewer edges. For each of these graphs H we...
AbstractThere are sixteen 3-connected graphs on eleven or fewer edges. For each of these graphs H we...
This dissertation solves two problems relating to the structure of graphs. The first of these is mot...
AbstractAt the core of the Robertson–Seymour theory of graph minors lies a powerful structure theore...
AbstractTutte's wheels theorem states that the k-spoked wheel graphs, Wk, are the basic building blo...
AbstractThis paper contains the cornerstone theorem of the series. We study the structure of graphs ...
A graph H is a minor of another graph G, denoted by $H\ {\prec\sb{m}}\ G,$ if a graph isomorphic to ...
A graph H is a minor of another graph G, denoted by $H\ {\prec\sb{m}}\ G,$ if a graph isomorphic to ...
AbstractLet ν(G) be the graph invariant introduced by Colin de Verdière in J. Combin. Theory Ser. B....
AbstractA graph is a minor of another if the first can be obtained from a subgraph of the second by ...
A graph G contains a graph H as a pivot-minor if H can be obtained from G by applying a sequence of ...
AbstractWe prove that for every planar graph H there is a number w such that every graph with no min...
AbstractAt the core of the Robertson–Seymour theory of graph minors lies a powerful structure theore...
Jorgensen conjectured that every 6-connected graph with no K-6 minor has a vertex whose deletion mak...
An exact structure is described to classify the projective‐planar graphs that do not contain a K3, 4...