On the spanning tree packing number of a graph: A survey (Q5931406)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1591058
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the spanning tree packing number of a graph: A survey |
scientific article; zbMATH DE number 1591058 |
Statements
On the spanning tree packing number of a graph: A survey (English)
0 references
24 April 2001
0 references
The spanning tree packing number of a graph \(G\) is the maximum number of edge-disjoint spanning trees contained in \(G\). The author applies a result of Catlin to investigate the spanning tree packing numbers of several families of graphs including quasi-random graphs, regular graphs, complete bipartite graphs, Cartesian products and the hypercubes.
0 references
spanning tree packing number
0 references
quasi-random graphs
0 references
regular graphs
0 references
bipartite graphs
0 references
hypercubes
0 references
0.8565467000007629
0 references
0.8296108841896057
0 references
0.8085460662841797
0 references
0.7988852262496948
0 references
0.7987553477287292
0 references
