Algebraic methods for counting Euclidean embeddings of rigid graphs

DOI10.1007/978-3-642-11805-0_19MaRDI QIDQ3557877zbMATH OpenOpenAlexWikidataFDO

Authors Ioannis Z. Emiris, Elias P. Tsigaridas, A. Varvitsiotis

Publication date 27 April 2010

Published in Graph Drawing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-11805-0_19

zbMATH Keywords

cyclohexane caterpillarEuclidean embeddingHenneberg constructionpolynomial systemrigid graphroot bound

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Enumeration in graph theory (05C30)

Recommendations

• Mixed volume and distance geometry techniques for counting Euclidean embeddings of rigid graphs
• On the number of embeddings of minimally rigid graphs
• New upper bounds for the number of embeddings of minimally rigid graphs
• On the multihomogeneous Bézout bound on the number of embeddings of minimally rigid graphs
• On the maximal number of real embeddings of spatial minimally rigid graphs

Cited in

(15)

• Mixed volume techniques for embeddings of Laman graphs
• The number of embeddings of minimally rigid graphs
• The algebraic matroid of the finite unit norm tight frame (funtf) variety
• On the multihomogeneous Bézout bound on the number of embeddings of minimally rigid graphs
• An asymptotic upper bound for graph embeddings
• New upper bounds for the number of embeddings of minimally rigid graphs
• Counting realizations of Laman graphs on the sphere
• On the maximal number of real embeddings of minimally rigid graphs in \(\mathbb{R}^2,\mathbb{R}^3\) and \(S^2\)
• Mixed volume and distance geometry techniques for counting Euclidean embeddings of rigid graphs
• On the number of embeddings of minimally rigid graphs
• The number of realizations of a Laman graph
• Algebraic Distance Graphs and Rigidity
• Lower bounds on the number of realizations of rigid graphs
• On the maximal number of real embeddings of spatial minimally rigid graphs
• Coupler curves of moving graphs and counting realizations of rigid graphs

Describes a project that uses

Uses Software

• SageMath

This page was built for publication: Algebraic methods for counting Euclidean embeddings of rigid graphs

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