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

DOI10.1016/S0012-365X(00)00066-2zbMath0980.05020OpenAlexW1973091456MaRDI 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 graphsbipartite graphshypercubesquasi-random graphsspanning tree packing number

Mathematics Subject Classification ID

Trees (05C05) Random graphs (graph-theoretic aspects) (05C80) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items

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