DOIAbstract
AbstractThere 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
AbstractThere 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
AbstractIn this paper it is shown that any 4-connected graph that does not contain a minor isomorphi...
Let ¿(G) be the graph invariant introduced by Colin de Verdière in J. Combin. Theory Ser. B. 74 (199...
In this paper, we present three results: (1) Let G be a (k + 2)-connected non-(k - 3)-apex graph whe...
There are sixteen 3-connected graphs on eleven or fewer edges. For each of these graphs H we discuss...
AbstractThere are sixteen 3-connected graphs on eleven or fewer edges. For each of these graphs H we...
AbstractA graph is a minor of another if the first can be obtained from a subgraph of the second by ...
AbstractWe prove that for every planar graph H there is a number w such that every graph with no min...
We provide a complete structural characterization of K2,4-minor-free graphs. The 3-connected K2,4-mi...
AbstractAt the core of the Robertson–Seymour theory of graph minors lies a powerful structure theore...
Let ¿(G) be the graph invariant introduced by Colin de Verdière in J. Combin. Theory Ser. B. 74 (199...
Let ¿(G) be the graph invariant introduced by Colin de Verdière in J. Combin. Theory Ser. B. 74 (199...
In this paper, we present three results: (1) Let G be a (k + 2)-connected non-(k - 3)-apex graph whe...
Let ¿(G) be the graph invariant introduced by Colin de Verdière in J. Combin. Theory Ser. B. 74 (199...
Let ¿(G) be the graph invariant introduced by Colin de Verdière in J. Combin. Theory Ser. B. 74 (199...
AbstractSuppose G is a k-connected graph that does not contain Kk as a minor. What does G look like?...
AbstractIn this paper it is shown that any 4-connected graph that does not contain a minor isomorphi...
Let ¿(G) be the graph invariant introduced by Colin de Verdière in J. Combin. Theory Ser. B. 74 (199...
In this paper, we present three results: (1) Let G be a (k + 2)-connected non-(k - 3)-apex graph whe...
There are sixteen 3-connected graphs on eleven or fewer edges. For each of these graphs H we discuss...
AbstractThere are sixteen 3-connected graphs on eleven or fewer edges. For each of these graphs H we...
AbstractA graph is a minor of another if the first can be obtained from a subgraph of the second by ...
AbstractWe prove that for every planar graph H there is a number w such that every graph with no min...
We provide a complete structural characterization of K2,4-minor-free graphs. The 3-connected K2,4-mi...
AbstractAt the core of the Robertson–Seymour theory of graph minors lies a powerful structure theore...
Let ¿(G) be the graph invariant introduced by Colin de Verdière in J. Combin. Theory Ser. B. 74 (199...
Let ¿(G) be the graph invariant introduced by Colin de Verdière in J. Combin. Theory Ser. B. 74 (199...
In this paper, we present three results: (1) Let G be a (k + 2)-connected non-(k - 3)-apex graph whe...
Let ¿(G) be the graph invariant introduced by Colin de Verdière in J. Combin. Theory Ser. B. 74 (199...
Let ¿(G) be the graph invariant introduced by Colin de Verdière in J. Combin. Theory Ser. B. 74 (199...
AbstractSuppose G is a k-connected graph that does not contain Kk as a minor. What does G look like?...
AbstractIn this paper it is shown that any 4-connected graph that does not contain a minor isomorphi...
Let ¿(G) be the graph invariant introduced by Colin de Verdière in J. Combin. Theory Ser. B. 74 (199...
In this paper, we present three results: (1) Let G be a (k + 2)-connected non-(k - 3)-apex graph whe...
Add to ORKG