On characterizations of rigid graphs in the plane using spanning trees
DOI10.1007/S00373-008-0836-2zbMATH Open1221.05038OpenAlexW2076896026MaRDI QIDQ1043809FDOQ1043809
Authors: Sergey Bereg 
Publication date: 9 December 2009
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-008-0836-2
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
Trees (05C05) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Rigidity and flexibility of structures (aspects of discrete geometry) (52C25)
Cites Work
- On graphs and rigidity of plane skeletal structures
- Title not available (Why is that?)
- On Generic Rigidity in the Plane
- Minimum partition of a matroid into independent subsets
- Rigid tensegrity labelings of graphs
- Title not available (Why is that?)
- A network theory approach to the rigidity of skeletal structures. II: Laman's theorem and topological formulae
Cited In (9)
- 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
- Enumerating combinatorial resultant trees
- Sparsity and connectivity of medial graphs: Concerning two edge-disjoint Hamiltonian paths in planar rigidity circuits
- Good orientations of unions of edge‐disjoint spanning trees
- Source location with rigidity and tree packing requirements
- \(\ell^1\) and \(\ell^\infty\) plane
- A Henneberg-based algorithm for generating tree-decomposable minimally rigid graphs
- A note on \(l_ 1\)-rigid planar 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)
