Packing of rigid spanning subgraphs and spanning trees
From MaRDI portal
Publication:401490
DOI10.1016/j.jctb.2013.11.003zbMath1300.05247arXiv1201.3727OpenAlexW2096249258MaRDI QIDQ401490
Olivier Durand de Gevigney, Zoltán Szigeti, Joseph Cheriyan
Publication date: 27 August 2014
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1201.3727
Trees (05C05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Combinatorial aspects of matroids and geometric lattices (05B35)
Related Items (10)
Packing spanning trees and spanning 2-connected \(k\)-edge-connected essentially \((2k-1)\)-edge-connected subgraphs ⋮ Spanning Rigid Subgraph Packing and Sparse Subgraph Covering ⋮ On orientations maximizing total arc-connectivity ⋮ Monotone Edge Flips to an Orientation of Maximum Edge-Connectivity à la Nash-Williams ⋮ Count and cofactor matroids of highly connected graphs ⋮ Graph rigidity for unitarily invariant matrix norms ⋮ Strongly 2-connected orientations of graphs ⋮ On Frank's conjecture on \(k\)-connected orientations ⋮ Spectral conditions for graph rigidity in the Euclidean plane ⋮ Sufficient connectivity conditions for rigidity of symmetric frameworks
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A sufficient connectivity condition for generic rigidity in the plane
- Connected rigidity matroids and unique realizations of graphs
- Sparse certificates and removable cycles in \(l\)-mixed \(p\)-connected graphs
- Simultaneous well-balanced orientations of graphs
- On the existence of \(k\) edge-disjoint 2-connected spanning subgraphs
- On the Problem of Decomposing a Graph into n Connected Factors
- Edge-Disjoint Spanning Trees of Finite Graphs
- On Generic Rigidity in the Plane
- Two‐connected orientations of Eulerian graphs
This page was built for publication: Packing of rigid spanning subgraphs and spanning trees
