A minmax relationship between embeddable and rigid graphs

DOI10.1016/S0893-9659(97)00062-1MaRDI QIDQ1372309zbMATH OpenFDO

Authors T.-S. Tay, Jurg Nievergelt

Publication date 30 March 1998

Published in Applied Mathematics Letters (Search for Journal in Brave)

zbMATH Keywords

weighted graphsgeneric graphselastic embeddings

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10)

Recommendations

• On the number of embeddings of minimally rigid graphs
• The number of embeddings of minimally rigid graphs
• New upper bounds for the number of embeddings of minimally rigid graphs
• scientific article; zbMATH DE number 683300
• On the maximal number of real embeddings of spatial minimally rigid graphs
• Minimally globally rigid graphs
• On the multihomogeneous Bézout bound on the number of embeddings of minimally rigid graphs
• scientific article; zbMATH DE number 3926946
• On minimally highly vertex-redundantly rigid graphs
• Minors, embeddability, and extremal problems for hypergraphs

Cites work

• scientific article; zbMATH DE number 3846996 (Why is no real title available?)
• scientific article; zbMATH DE number 3917126 (Why is no real title available?)
• scientific article; zbMATH DE number 17636 (Why is no real title available?)
• scientific article; zbMATH DE number 501471 (Why is no real title available?)
• scientific article; zbMATH DE number 3294853 (Why is no real title available?)
• Metric graphs elastically embeddable in the plane
• The Rigidity of Graphs

Cited in

(3)

• The number of embeddings of minimally rigid graphs
• scientific article; zbMATH DE number 683300 (Why is no real title available?)
• Elastic graphs

This page was built for publication: A minmax relationship between embeddable and rigid graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1372309)