Algebraic Methods for Counting Euclidean Embeddings of Rigid Graphs

DOI10.1007/978-3-642-11805-0_19zbMath1284.05137OpenAlexW2100909061WikidataQ57908716 ScholiaQ57908716MaRDI QIDQ3557877

Ioannis Z. Emiris, Elias P. Tsigaridas, Antonios 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

polynomial systemEuclidean embeddingrigid graphHenneberg constructioncyclohexane caterpillarroot bound

Mathematics Subject Classification ID

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

Related Items (4)

The Number of Realizations of a Laman Graph ⋮ Coupler curves of moving graphs and counting realizations of rigid graphs ⋮ Lower Bounds on the Number of Realizations of Rigid Graphs ⋮ The algebraic matroid of the finite unit norm tight frame (funtf) variety

Uses Software

• SageMath

This page was built for publication: Algebraic Methods for Counting Euclidean Embeddings of Rigid Graphs