On characterizations of rigid graphs in the plane using spanning trees
From MaRDI portal
Recommendations
- Abstract and generic rigidity in the plane
- Sparsity and connectivity of medial graphs: Concerning two edge-disjoint Hamiltonian paths in planar rigidity circuits
- Connected rigidity matroids and unique realizations of graphs
- Birigidity in the Plane
- On the two-dimensional generic rigidity matroid and its dual
Cites work
- scientific article; zbMATH DE number 5296049 (Why is no real title available?)
- scientific article; zbMATH DE number 952952 (Why is no real title available?)
- A network theory approach to the rigidity of skeletal structures. II: Laman's theorem and topological formulae
- Minimum partition of a matroid into independent subsets
- On Generic Rigidity in the Plane
- On graphs and rigidity of plane skeletal structures
- Rigid tensegrity labelings of graphs
Cited in
(9)- A note on \(l_ 1\)-rigid planar graphs
- Good orientations of unions of edge‐disjoint spanning trees
- Rooted-tree decompositions with matroid constraints and the infinitesimal rigidity of frameworks with boundaries
- A constructive characterisation of circuits in the simple \((2,2)\)-sparsity matroid
- Source location with rigidity and tree packing requirements
- Sparsity and connectivity of medial graphs: Concerning two edge-disjoint Hamiltonian paths in planar rigidity circuits
- Enumerating combinatorial resultant trees
- \(\ell^1\) and \(\ell^\infty\) plane
- A Henneberg-based algorithm for generating tree-decomposable minimally rigid graphs
This page was built for publication: On characterizations of rigid graphs in the plane using spanning trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1043809)
