AbstractLet A be a set of vertices of some graph G. An A-tree is a subtree of G containing A, and A is called k-edge-connected in G if every set of less than k edges in G misses at least one A-tree. We prove that every ⌈3k2⌉-edge-connected set A of four vertices in a graph admits a set of k edge disjoint A-trees. The bound ⌈3k2⌉ is best possible for all k>1
AbstractIn this paper it is proved that for any fixed r and k the number T(G; n, k) of spanning tree...
AbstractWe consider the minimum number ⊤(G) of subsets into which the edge set E(G) of a graph G can...
AbstractIn this article, we deal with a connectivity problem stated by Maurer and Slater to characte...
AbstractLet A be a set of vertices of some graph G. An A-tree is a subtree of G containing A, and A ...
AbstractNash-Williams and Tutte independently characterized when a graph has k edge-disjoint spannin...
AbstractWe show that for any two natural numbers k,ℓ there exist (smallest natural numbers fℓ(k)(gℓ(...
AbstractMader proved that for every k-edge-connected graph G (k ≥ 4), there exists a path joining tw...
AbstractWe call a graph G (k,n)-path-connected iff for any subset A of the vertex set of G with card...
AbstractIt is shown that an n-edge connected graph has at least ⌈(n − 1)2⌉ pairwise edge-disjoint sp...
AbstractWe give a short elementary proof of Tutte and Nash-Williams’ characterization of graphs with...
AbstractLetGbe a simple graph withnvertices and letGcdenote the complement ofG. Letω(G)denote the nu...
Let T be a distinguished subset of vertices in a graph G. A T-Steiner tree is a subgraph of G that i...
AbstractWe give a constructive characterization of undirected graphs which contain k spanning trees ...
AbstractIn this paper we continue the investigations in [3] for the Steiner tree packing polyhedron....
AbstractA graph G is called (k, n)-pendant tree-connected, iff for any subset A of the vertex set of...
AbstractIn this paper it is proved that for any fixed r and k the number T(G; n, k) of spanning tree...
AbstractWe consider the minimum number ⊤(G) of subsets into which the edge set E(G) of a graph G can...
AbstractIn this article, we deal with a connectivity problem stated by Maurer and Slater to characte...
AbstractLet A be a set of vertices of some graph G. An A-tree is a subtree of G containing A, and A ...
AbstractNash-Williams and Tutte independently characterized when a graph has k edge-disjoint spannin...
AbstractWe show that for any two natural numbers k,ℓ there exist (smallest natural numbers fℓ(k)(gℓ(...
AbstractMader proved that for every k-edge-connected graph G (k ≥ 4), there exists a path joining tw...
AbstractWe call a graph G (k,n)-path-connected iff for any subset A of the vertex set of G with card...
AbstractIt is shown that an n-edge connected graph has at least ⌈(n − 1)2⌉ pairwise edge-disjoint sp...
AbstractWe give a short elementary proof of Tutte and Nash-Williams’ characterization of graphs with...
AbstractLetGbe a simple graph withnvertices and letGcdenote the complement ofG. Letω(G)denote the nu...
Let T be a distinguished subset of vertices in a graph G. A T-Steiner tree is a subgraph of G that i...
AbstractWe give a constructive characterization of undirected graphs which contain k spanning trees ...
AbstractIn this paper we continue the investigations in [3] for the Steiner tree packing polyhedron....
AbstractA graph G is called (k, n)-pendant tree-connected, iff for any subset A of the vertex set of...
AbstractIn this paper it is proved that for any fixed r and k the number T(G; n, k) of spanning tree...
AbstractWe consider the minimum number ⊤(G) of subsets into which the edge set E(G) of a graph G can...
AbstractIn this article, we deal with a connectivity problem stated by Maurer and Slater to characte...
DOI
Add to ORKG