On characterizations of rigid graphs in the plane using spanning trees

DOI10.1007/s00373-008-0836-2zbMath1221.05038OpenAlexW2076896026MaRDI QIDQ1043809

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

zbMATH Keywords

rigid graphscircuitstensegrity frameworks

Mathematics Subject Classification ID

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

• A network theory approach to the rigidity of skeletal structures. II: Laman's theorem and topological formulae
• Rigid tensegrity labelings of graphs
• On graphs and rigidity of plane skeletal structures
• On Generic Rigidity in the Plane
• Minimum partition of a matroid into independent subsets
• Unnamed Item
• Unnamed Item