Add to ORKGJørgensen conjectured that every 6-connected graph with no K6 minor has a vertex whose deletion makes the graph planar. We prove the conjecture for all sufficiently large graphs
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...
The classical Hadwiger conjecture dating back to 1940s states that any graph of chromatic number at ...
A simple graph is a minor of another if the first is obtained from the second by deleting vertices, ...
We prove that every sufficiently large 6-connected graph of bounded tree-width either has a K6 minor...
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...
We prove that every sufficiently large 6-connected graph of bounded tree-width either has a K6 minor...
AbstractLet G be a 3-connected planar graph and let U⊆V(G). It is shown that G contains a K2, t mino...
AbstractSuppose G is a k-connected graph that does not contain Kk as a minor. What does G look like?...
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 show that the only graphs with certain connectivity and planarity properties are the Pete...
AbstractWe prove that for every planar graph H there is a number w such that every graph with no min...
AbstractA weakening of Hadwiger’s conjecture states that every n-vertex graph with independence numb...
Hadwiger\u27s conjecture from 1943 states that for every integer t≥1, every graph either can be t-co...
As pointed out by Seymour in his recent survey on Hadwiger's conjecture, proving that graphs with no...
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...
The classical Hadwiger conjecture dating back to 1940s states that any graph of chromatic number at ...
A simple graph is a minor of another if the first is obtained from the second by deleting vertices, ...
We prove that every sufficiently large 6-connected graph of bounded tree-width either has a K6 minor...
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...
We prove that every sufficiently large 6-connected graph of bounded tree-width either has a K6 minor...
AbstractLet G be a 3-connected planar graph and let U⊆V(G). It is shown that G contains a K2, t mino...
AbstractSuppose G is a k-connected graph that does not contain Kk as a minor. What does G look like?...
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 show that the only graphs with certain connectivity and planarity properties are the Pete...
AbstractWe prove that for every planar graph H there is a number w such that every graph with no min...
AbstractA weakening of Hadwiger’s conjecture states that every n-vertex graph with independence numb...
Hadwiger\u27s conjecture from 1943 states that for every integer t≥1, every graph either can be t-co...
As pointed out by Seymour in his recent survey on Hadwiger's conjecture, proving that graphs with no...
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...
The classical Hadwiger conjecture dating back to 1940s states that any graph of chromatic number at ...
A simple graph is a minor of another if the first is obtained from the second by deleting vertices, ...