Add to ORKGWe prove that every sufficiently large 6-connected graph of bounded tree-width either has a K6 minor, or has a vertex whose deletion makes the graph planar. This is a step toward proving that the same conclusion holds for all sufficiently large 6-connected graphs. Jørgensen conjectured that it holds for all 6-connected graphs
AbstractLet T6 denote the class of all 6-connected (equivalently 6-regular) toroidal graphs and let ...
AbstractAt the core of the Robertson–Seymour theory of graph minors lies a powerful structure theore...
Let G be a 3-connected planar graph and let U ` V (G). It is shown that G contains a K 2;t minor suc...
We prove that every sufficiently large 6-connected graph of bounded tree-width either has a K6 minor...
Jørgensen conjectured that every 6-connected graph with no K6 minor has a vertex whose deletion make...
We prove that every sufficiently large 6-connected graph of bounded tree-width either has a K6 minor...
Jorgensen conjectured that every 6-connected graph with no K-6 minor has a vertex whose deletion mak...
AbstractIt is shown that for any positive integers k and w there exists a constant N=N(k,w) such tha...
AbstractSuppose G is a k-connected graph that does not contain Kk as a minor. What does G look like?...
Bollobás and Thomason showed that every 22k-connected graph is k-linked. Their result used a dense g...
AbstractLet a be an integer. It is proved that for any s and k, there exists a constant N=N(s,k,a) s...
AbstractWe prove that for every planar graph H there is a number w such that every graph with no min...
AbstractLet K6 denote the class of all 6-regular graphs which admit an embedding into the Klein bott...
As pointed out by Seymour in his recent survey on Hadwiger's conjecture, proving that graphs with no...
AbstractIn an earlier paper, the first two authors proved that for any planar graph H, every graph w...
AbstractLet T6 denote the class of all 6-connected (equivalently 6-regular) toroidal graphs and let ...
AbstractAt the core of the Robertson–Seymour theory of graph minors lies a powerful structure theore...
Let G be a 3-connected planar graph and let U ` V (G). It is shown that G contains a K 2;t minor suc...
We prove that every sufficiently large 6-connected graph of bounded tree-width either has a K6 minor...
Jørgensen conjectured that every 6-connected graph with no K6 minor has a vertex whose deletion make...
We prove that every sufficiently large 6-connected graph of bounded tree-width either has a K6 minor...
Jorgensen conjectured that every 6-connected graph with no K-6 minor has a vertex whose deletion mak...
AbstractIt is shown that for any positive integers k and w there exists a constant N=N(k,w) such tha...
AbstractSuppose G is a k-connected graph that does not contain Kk as a minor. What does G look like?...
Bollobás and Thomason showed that every 22k-connected graph is k-linked. Their result used a dense g...
AbstractLet a be an integer. It is proved that for any s and k, there exists a constant N=N(s,k,a) s...
AbstractWe prove that for every planar graph H there is a number w such that every graph with no min...
AbstractLet K6 denote the class of all 6-regular graphs which admit an embedding into the Klein bott...
As pointed out by Seymour in his recent survey on Hadwiger's conjecture, proving that graphs with no...
AbstractIn an earlier paper, the first two authors proved that for any planar graph H, every graph w...
AbstractLet T6 denote the class of all 6-connected (equivalently 6-regular) toroidal graphs and let ...
AbstractAt the core of the Robertson–Seymour theory of graph minors lies a powerful structure theore...
Let G be a 3-connected planar graph and let U ` V (G). It is shown that G contains a K 2;t minor suc...