On Graver's conjecture concerning the rigidity problem of graphs

DOI10.1007/BF02574693zbMath0724.05035WikidataQ123282074 ScholiaQ123282074MaRDI QIDQ2276975

Hiroshi Maehara

Publication date: 1991

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/131162

zbMATH Keywords

frameworkd-isostatic graphsedge minimal generically rigid graphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Related Items (1)

On the multihomogeneous Bézout bound on the number of embeddings of minimally rigid graphs

Cites Work

• Unnamed Item
• Infinitesimal motions of a bipartite framework
• When is a bipartite graph a rigid framework?
• On graphs and rigidity of plane skeletal structures
• Rigid and Flexible Frameworks
• The Rigidity of Graphs

This page was built for publication: On Graver's conjecture concerning the rigidity problem of graphs