Document Type
Article
Publication Date
10-2009
Publication Title
Ars Combinatoria
First Page
113
Last Page
127
Abstract
The spanning tree packing number of a connected graph G, denoted by T(G), is the maximum number of edge-disjoint spanning trees of G. In this paper, we determine the minimum number of edges that must be added to G so that the resulting graph has spanning tree packing number at least k, for a given value of k.
Rights
This article was originally published in Ars Combinatoria, 2009, Volume 93.
Recommended Citation
Liu, Damin; Lai, Hong-Jian; and Chen, Zhi-Hong, "Reinforcing the number of disjoint spanning trees" Ars Combinatoria / (2009): 113-127.
Available at https://digitalcommons.butler.edu/facsch_papers/1048