AbstractIt is shown that for any positive integers k and w there exists a constant N=N(k,w) such that every 7-connected graph of tree-width less than w and of order at least N contains K3,k as a minor. Similar result is proved for Ka,k minors where a is an arbitrary fixed integer and the required connectivity depends only on a. These are the first results of this type where fixed connectivity forces arbitrarily large (nontrivial) minors
Treewidth and its linear variant path-width play a central role for the graph minor relation. Rank-w...
Treewidth and its linear variant path-width play a central role for the graph minor relation. Rank-w...
AbstractThe purpose of this note is to give a connectivity condition for a graph to have a rooted co...
AbstractIt is shown that for any positive integers k and w there exists a constant N=N(k,w) such tha...
AbstractLet a be an integer. It is proved that for any s and k, there exists a constant N=N(s,k,a) s...
We prove that every sufficiently large 6-connected graph of bounded tree-width either has a K6 minor...
AbstractMyers conjectured that for every integer s there exists a positive constant C such that for ...
Bollobás and Thomason showed that every 22k-connected graph is k-linked. Their result used a dense g...
AbstractThe purpose of this note is to give a connectivity condition for a graph to have a rooted co...
Abstract. A fundamental result in structural graph theory states that every graph with large average...
Treewidth and its linear variant path-width play a central role for the graph minor relation. Rank-...
Abstract. We prove that every graph of rank-width k is a pivot-minor of a graph of tree-width at mos...
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 ...
A fundamental result of Mader from 1972 asserts that a graph of high average degree contains a highl...
Treewidth and its linear variant path-width play a central role for the graph minor relation. Rank-w...
Treewidth and its linear variant path-width play a central role for the graph minor relation. Rank-w...
AbstractThe purpose of this note is to give a connectivity condition for a graph to have a rooted co...
AbstractIt is shown that for any positive integers k and w there exists a constant N=N(k,w) such tha...
AbstractLet a be an integer. It is proved that for any s and k, there exists a constant N=N(s,k,a) s...
We prove that every sufficiently large 6-connected graph of bounded tree-width either has a K6 minor...
AbstractMyers conjectured that for every integer s there exists a positive constant C such that for ...
Bollobás and Thomason showed that every 22k-connected graph is k-linked. Their result used a dense g...
AbstractThe purpose of this note is to give a connectivity condition for a graph to have a rooted co...
Abstract. A fundamental result in structural graph theory states that every graph with large average...
Treewidth and its linear variant path-width play a central role for the graph minor relation. Rank-...
Abstract. We prove that every graph of rank-width k is a pivot-minor of a graph of tree-width at mos...
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 ...
A fundamental result of Mader from 1972 asserts that a graph of high average degree contains a highl...
Treewidth and its linear variant path-width play a central role for the graph minor relation. Rank-w...
Treewidth and its linear variant path-width play a central role for the graph minor relation. Rank-w...
AbstractThe purpose of this note is to give a connectivity condition for a graph to have a rooted co...
DOI
Add to ORKG