Add to ORKGAbstract. A graph G is loosely-c-connected, or ℓ-c-connected, if there exists a number d depending on G such that the deletion of fewer than c vertices from G leaves precisely one infinite component and a graph containing at most d vertices. In this paper, we give the structure of a set of ℓ-c-connected infinite graphs that form an unavoidable set among the topological minors of ℓ-c-connected infinite graphs. Corresponding results for minors and parallel minors are also obtained. 1
We construct infinite planar graphs of arbitrarily large connectivity and girth, and study their sep...
We say that a graph is non-apex if the removal of any vertex results in a non-planar graph. We say t...
AbstractWe prove the following result. Suppose that for every graph G in a class C of graphs, and fo...
AbstractA graph G is loosely-c-connected, or ℓ-c-connected, if there exists a number d depending on ...
A graph G is loosely-c-connected, or ℓ-c-connected, if there exists a number d depending on G such t...
Artículo de publicación ISI.It is well known that in finite graphs, large complete minors/topologica...
It is well-known that in finite graphs, large complete minors/topological minors can be forced by as...
We present a construction of two infinite graphs G1, G2 and of an infinite set F of graphs such that...
AbstractWe present a construction of two infinite graphs G1, G2 and of an infinite set F of graphs s...
AbstractLet a be an integer. It is proved that for any s and k, there exists a constant N=N(s,k,a) s...
Robertson and Seymour proved that graphs are well-quasi-ordered by the minor relation. In other word...
AbstractLet κ be an infinite cardinal, and let H be either a complete graph with κ vertices, or a tr...
AbstractWe prove that for every planar graph H there is a number w such that every graph with no min...
A graph H is a minor of another graph G, denoted by $H\ {\prec\sb{m}}\ G,$ if a graph isomorphic to ...
AbstractWe survey various aspects of infinite extremal graph theory and prove several new results. T...
We construct infinite planar graphs of arbitrarily large connectivity and girth, and study their sep...
We say that a graph is non-apex if the removal of any vertex results in a non-planar graph. We say t...
AbstractWe prove the following result. Suppose that for every graph G in a class C of graphs, and fo...
AbstractA graph G is loosely-c-connected, or ℓ-c-connected, if there exists a number d depending on ...
A graph G is loosely-c-connected, or ℓ-c-connected, if there exists a number d depending on G such t...
Artículo de publicación ISI.It is well known that in finite graphs, large complete minors/topologica...
It is well-known that in finite graphs, large complete minors/topological minors can be forced by as...
We present a construction of two infinite graphs G1, G2 and of an infinite set F of graphs such that...
AbstractWe present a construction of two infinite graphs G1, G2 and of an infinite set F of graphs s...
AbstractLet a be an integer. It is proved that for any s and k, there exists a constant N=N(s,k,a) s...
Robertson and Seymour proved that graphs are well-quasi-ordered by the minor relation. In other word...
AbstractLet κ be an infinite cardinal, and let H be either a complete graph with κ vertices, or a tr...
AbstractWe prove that for every planar graph H there is a number w such that every graph with no min...
A graph H is a minor of another graph G, denoted by $H\ {\prec\sb{m}}\ G,$ if a graph isomorphic to ...
AbstractWe survey various aspects of infinite extremal graph theory and prove several new results. T...
We construct infinite planar graphs of arbitrarily large connectivity and girth, and study their sep...
We say that a graph is non-apex if the removal of any vertex results in a non-planar graph. We say t...
AbstractWe prove the following result. Suppose that for every graph G in a class C of graphs, and fo...