Publication date
May 2012
DOI Publisher
Elsevier B.V. ISSN
0012-365X Citation count (estimate)
6Abstract
AbstractWe give a short elementary proof of Tutte and Nash-Williams’ characterization of graphs with k edge-disjoint spanning trees
AbstractWe give a short elementary proof of Tutte and Nash-Williams’ characterization of graphs with k edge-disjoint spanning trees
AbstractThe well-known spanning tree packing theorem of Nash-Williams and Tutte characterizes graphs...
In this paper several infinite extensions of the well-known results for packing bases in finite matr...
In this thesis, we study extremal problems concerning cycles and paths in graphs, graph packing, and...
AbstractWe give a short elementary proof of Tutte and Nash-Williams’ characterization of graphs with...
We give a short elementary proof of Tutte and Nash-Williams' characterization of graphs with k ...
AbstractNash-Williams and Tutte independently characterized when a graph has k edge-disjoint spannin...
AbstractWe give a constructive characterization of undirected graphs which contain k spanning trees ...
AbstractGiven an undirected graphG=(V,E) and a partition {S,T} ofV, anS−Tconnectoris a set of edgesF...
AbstractNash-Williams and Tutte independently characterized when a graph has k edge-disjoint spannin...
AbstractThe well-known spanning tree packing theorem of Nash-Williams and Tutte characterizes graphs...
AbstractGiven an undirected graphG=(V,E) and a partition {S,T} ofV, anS−Tconnector is a set of edges...
In this paper we fix 7 types of undirected graphs: paths, paths with prescribed endvertices, circuit...
In this paper we fix 7 types of undirected graphs: paths, paths with prescribed endvertices, circuit...
The spanning tree packing number of a connected graph G, denoted by T(G), is the maximum number of e...
AbstractIn this paper we study two types of edge-disjoint packings of graphs. The induced edge-disjo...
AbstractThe well-known spanning tree packing theorem of Nash-Williams and Tutte characterizes graphs...
In this paper several infinite extensions of the well-known results for packing bases in finite matr...
In this thesis, we study extremal problems concerning cycles and paths in graphs, graph packing, and...
AbstractWe give a short elementary proof of Tutte and Nash-Williams’ characterization of graphs with...
We give a short elementary proof of Tutte and Nash-Williams' characterization of graphs with k ...
AbstractNash-Williams and Tutte independently characterized when a graph has k edge-disjoint spannin...
AbstractWe give a constructive characterization of undirected graphs which contain k spanning trees ...
AbstractGiven an undirected graphG=(V,E) and a partition {S,T} ofV, anS−Tconnectoris a set of edgesF...
AbstractNash-Williams and Tutte independently characterized when a graph has k edge-disjoint spannin...
AbstractThe well-known spanning tree packing theorem of Nash-Williams and Tutte characterizes graphs...
AbstractGiven an undirected graphG=(V,E) and a partition {S,T} ofV, anS−Tconnector is a set of edges...
In this paper we fix 7 types of undirected graphs: paths, paths with prescribed endvertices, circuit...
In this paper we fix 7 types of undirected graphs: paths, paths with prescribed endvertices, circuit...
The spanning tree packing number of a connected graph G, denoted by T(G), is the maximum number of e...
AbstractIn this paper we study two types of edge-disjoint packings of graphs. The induced edge-disjo...
AbstractThe well-known spanning tree packing theorem of Nash-Williams and Tutte characterizes graphs...
In this paper several infinite extensions of the well-known results for packing bases in finite matr...
In this thesis, we study extremal problems concerning cycles and paths in graphs, graph packing, and...
Add to ORKG