On the spanning tree packing number of a graph: A survey (Q5931406): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/s0012-365x(00)00066-2 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1973091456 / rank | |||
Normal rank | |||
Latest revision as of 10:27, 30 July 2024
scientific article; zbMATH DE number 1591058
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
