The \(d\)-dimensional rigidity matroid of sparse graphs
From MaRDI portal
Publication:2565690
DOI10.1016/j.jctb.2005.03.004zbMath1070.05022OpenAlexW2079335274MaRDI QIDQ2565690
Publication date: 28 September 2005
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jctb.2005.03.004
Related Items
Packing spanning trees and spanning 2-connected \(k\)-edge-connected essentially \((2k-1)\)-edge-connected subgraphs ⋮ Which graphs are rigid in \(\ell_p^d\)? ⋮ Globally rigid powers of graphs ⋮ Maxwell-independence: a new rank estimate for the 3-dimensional generic rigidity matroid ⋮ Count and cofactor matroids of highly connected graphs ⋮ Global Rigidity of Line Constrained Frameworks ⋮ Unnamed Item ⋮ Efficient algorithms for the \(d\)-dimensional rigidity matroid of sparse graphs ⋮ On the rigidity of molecular graphs ⋮ ON THE RANK FUNCTION OF THE 3-DIMENSIONAL RIGIDITY MATROID
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Source location with rigidity and tree packing requirements
- Matroid matching and some applications
- Matroid theory and its applications in electric network theory and in statics
- Connected rigidity matroids and unique realizations of graphs
- On graphs and rigidity of plane skeletal structures
- On the Computational Complexity of a Rigidity Problem
- On Generic Rigidity in the Plane
- Algorithms for the d-Dimensional Rigidity Matroid of Sparse Graphs
