Packing spanning trees and spanning 2-connected k-edge-connected essentially (2k-1)-edge-connected subgraphs

Recommendations

Spanning tree packing and 2-essential edge-connectivity
Packing spanning trees in highly essentially connected graphs
On the existence of \(k\) edge-disjoint 2-connected spanning subgraphs
Packing of rigid spanning subgraphs and spanning trees
Spanning Rigid Subgraph Packing and Sparse Subgraph Covering

Cites work

Connections in combinatorial optimization
Edge-Disjoint Spanning Trees of Finite Graphs
scientific article; zbMATH DE number 4164908 (Why is no real title available?)
scientific article; zbMATH DE number 3313442 (Why is no real title available?)
On Generic Rigidity in the Plane
On the existence of \(k\) edge-disjoint 2-connected spanning subgraphs
On the Problem of Decomposing a Graph into n Connected Factors
Packing of rigid spanning subgraphs and spanning trees
Simultaneous well-balanced orientations of graphs
Strongly 2-connected orientations of graphs
The d-dimensional rigidity matroid of sparse graphs

Cited in

(11)

\(k\)-connectivity and decomposition of graphs into forests
Edge-disjoint trees containing some given vertices in a graph
Packing spanning trees in highly essentially connected graphs
Spectral conditions for graph rigidity in the Euclidean plane
Spanning tree packing and 2-essential edge-connectivity
Reinforcing the number of disjoint spanning trees
Packing of rigid spanning subgraphs and spanning trees
On spanning tree packings of highly edge connected graphs
Spanning Rigid Subgraph Packing and Sparse Subgraph Covering
A discharging method to find subgraphs having two edge-disjoint spanning trees.
Extremal spectral radius and essential edge-connectivity

This page was built for publication: Packing spanning trees and spanning 2-connected \(k\)-edge-connected essentially \((2k-1)\)-edge-connected subgraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2359795)