Computing the number of realisations of a rigid graph
From MaRDI portal
Planar graphs; geometric and topological aspects of graph theory (05C10) Intersection theory, characteristic classes, intersection multiplicities in algebraic geometry (14C17) Rigidity and flexibility of structures (aspects of discrete geometry) (52C25) Metric embeddings as related to computational problems and algorithms (68R12)
This page was built for publication: Computing the number of realisations of a rigid graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7196562)