On the spanning tree packing number of a graph: A survey

DOI10.1016/S0012-365X(00)00066-2zbMath0980.05020MaRDI QIDQ5931406

Edgar M. Palmer

Publication date: 24 April 2001

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(00)00066-2

zbMATH Keywords

regular graphs; bipartite graphs; hypercubes; quasi-random graphs; spanning tree packing number

Mathematics Subject Classification ID

05C05: Trees

05C80: Random graphs (graph-theoretic aspects)

05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)

Related Items

Tree robustness of a graph, Network Topology Vulnerability/Cost Trade-Off: Model, Application, and Computational Complexity, Packing the hypercube, Non-preemptive tree packing, Non-preemptive tree packing, Spectral radius and edge‐disjoint spanning trees, Decomposing the hypercube \(Q_n\) into \(n\) isomorphic edge-disjoint trees, Edge-disjoint spanning trees and eigenvalues of regular graphs, Characterizations of strength extremal graphs, Spanning trees: A survey, On Laplacian energy in terms of graph invariants, Characterization of removable elements with respect to having \(k\) disjoint bases in a matroid, Arboricity: an acyclic hypergraph decomposition problem motivated by database theory, Extensions of matroid covering and packing, Edge-disjoint spanning trees and forests of graphs, Strong subgraph connectivity of digraphs, Lattices over Bass rings and graph agglomerations, Extremal graphs for a spectral inequality on edge-disjoint spanning trees, On polyatomic tomography over abelian groups: some remarks on consistency, tree packings and complexity, The minimum size of a graph with given tree connectivity, Note on edge-disjoint spanning trees and eigenvalues, Computing the number of \(k\)-component spanning forests of a graph with bounded treewidth, Spanning tree packing number and eigenvalues of graphs with given girth, Nordhaus-Gaddum-type results for the generalized edge-connectivity of graphs, Degree sequence realizations with given packing and covering of spanning trees, Edge-disjoint spanning trees and eigenvalues, Note on the spanning-tree packing number of lexicographic product graphs, Path-connectivity of lexicographic product graphs, Rank and Bollobás-Riordan polynomials: Coefficient measures and zeros, Edge-Disjoint Spanning Trees, Edge Connectivity, and Eigenvalues in Graphs