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

From MaRDI portal
Publication:5931406

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




Related Items (30)

Extensions of matroid covering and packingLattices over Bass rings and graph agglomerationsExtremal graphs for a spectral inequality on edge-disjoint spanning treesEdge-Disjoint Spanning Trees, Edge Connectivity, and Eigenvalues in GraphsTree robustness of a graphSpectral radius and edge‐disjoint spanning treesDecomposing the hypercube \(Q_n\) into \(n\) isomorphic edge-disjoint treesOn polyatomic tomography over abelian groups: some remarks on consistency, tree packings and complexityEdge-disjoint spanning trees and eigenvalues of regular graphsEdge-disjoint spanning trees and eigenvaluesSpanning trees: A surveyRank and Bollobás-Riordan polynomials: Coefficient measures and zerosThe minimum size of a graph with given tree connectivityCharacterizations of strength extremal graphsOn Laplacian energy in terms of graph invariantsPacking the hypercubeNote on edge-disjoint spanning trees and eigenvaluesCharacterization of removable elements with respect to having \(k\) disjoint bases in a matroidEdge-disjoint spanning trees and forests of graphsNote on the spanning-tree packing number of lexicographic product graphsPath-connectivity of lexicographic product graphsNon-preemptive tree packingStrong subgraph connectivity of digraphsNon-preemptive tree packingComputing the number of \(k\)-component spanning forests of a graph with bounded treewidthArboricity: an acyclic hypergraph decomposition problem motivated by database theoryNetwork Topology Vulnerability/Cost Trade-Off: Model, Application, and Computational ComplexitySpanning tree packing number and eigenvalues of graphs with given girthNordhaus-Gaddum-type results for the generalized edge-connectivity of graphsDegree sequence realizations with given packing and covering of spanning trees




This page was built for publication: On the spanning tree packing number of a graph: A survey