Paper Info
Title
A Note On Packing Spanning Trees In Graphs And Bases In Matroids
Abstract
We consider the class of graphs for which the edge connectivity is equal to the maximum number of edge-disjoint spanning trees, and the natural generalization to matroids, where the cogirth is equal to the number of disjoint bases. We provide descriptions of such graphs and matroids, showing that such a graph (or matroid) has a unique decomposition. In the case of graphs, our results are relevant for certain communication protocols.
Year
Venue
Field
2014
AUSTRALASIAN JOURNAL OF COMBINATORICS
Matroid,Discrete mathematics,Combinatorics,Indifference graph,Clique-sum,Chordal graph,Dual graph,Cograph,Graphic matroid,Pathwidth,Mathematics
DocType
Volume
ISSN
Journal
59
2202-3518
Citations 
PageRank 
References 
0
0.34
11
Authors
3
Name
Order
Citations
PageRank
Robert Bailey1243.01
Mike Newman2385.81
Brett Stevens3306.68