Pages that link to "Item:Q5931406"
From MaRDI portal
The following pages link to On the spanning tree packing number of a graph: A survey (Q5931406):
Displayed 30 items.
- Decomposing the hypercube \(Q_n\) into \(n\) isomorphic edge-disjoint trees (Q418894) (← links)
- Edge-disjoint spanning trees and eigenvalues of regular graphs (Q426054) (← links)
- Characterizations of strength extremal graphs (Q489310) (← links)
- Spanning trees: A survey (Q659663) (← links)
- On Laplacian energy in terms of graph invariants (Q670686) (← links)
- Characterization of removable elements with respect to having \(k\) disjoint bases in a matroid (Q714036) (← links)
- Arboricity: an acyclic hypergraph decomposition problem motivated by database theory (Q765344) (← links)
- Extensions of matroid covering and packing (Q1633609) (← links)
- Edge-disjoint spanning trees and forests of graphs (Q2028071) (← links)
- Strong subgraph connectivity of digraphs (Q2045390) (← links)
- Lattices over Bass rings and graph agglomerations (Q2139542) (← links)
- Extremal graphs for a spectral inequality on edge-disjoint spanning trees (Q2152797) (← links)
- On polyatomic tomography over abelian groups: some remarks on consistency, tree packings and complexity (Q2197684) (← links)
- The minimum size of a graph with given tree connectivity (Q2227103) (← links)
- Note on edge-disjoint spanning trees and eigenvalues (Q2250921) (← links)
- Computing the number of \(k\)-component spanning forests of a graph with bounded treewidth (Q2314068) (← links)
- Spanning tree packing number and eigenvalues of graphs with given girth (Q2321370) (← links)
- Nordhaus-Gaddum-type results for the generalized edge-connectivity of graphs (Q2341720) (← links)
- Degree sequence realizations with given packing and covering of spanning trees (Q2341721) (← links)
- Edge-disjoint spanning trees and eigenvalues (Q2442253) (← links)
- Note on the spanning-tree packing number of lexicographic product graphs (Q2514151) (← links)
- Path-connectivity of lexicographic product graphs (Q2804863) (← links)
- Rank and Bollobás-Riordan polynomials: Coefficient measures and zeros (Q3295936) (← links)
- Edge-Disjoint Spanning Trees, Edge Connectivity, and Eigenvalues in Graphs (Q3466350) (← links)
- Tree robustness of a graph (Q4580048) (← links)
- Network Topology Vulnerability/Cost Trade-Off: Model, Application, and Computational Complexity (Q4985807) (← links)
- Packing the hypercube (Q5405279) (← links)
- Non-preemptive tree packing (Q5918626) (← links)
- Non-preemptive tree packing (Q5925632) (← links)
- Spectral radius and edge‐disjoint spanning trees (Q6084711) (← links)