LamanGraphs
From MaRDI portal
Software:54885
swMATH39185MaRDI QIDQ54885FDOQ54885
Author name not available (Why is that?)
Cited In (15)
- An asymptotic upper bound for graph embeddings
- Graphs with flexible labelings allowing injective realizations
- New upper bounds for the number of embeddings of minimally rigid graphs
- Lower bounds on the number of realizations of rigid graphs
- Equivalent realisations of a rigid graph
- The algebraic matroid of the finite unit norm tight frame (funtf) variety
- On the maximal number of real embeddings of minimally rigid graphs in \(\mathbb{R}^2,\mathbb{R}^3\) and \(S^2\)
- The Tropical Cayley--Menger Variety
- Globally rigid graphs are fully reconstructible
- Generic symmetry-forced infinitesimal rigidity: translations and rotations
- Computing the number of realizations of a Laman graph
- On the multihomogeneous Bézout bound on the number of embeddings of minimally rigid graphs
- FlexRiLoG -- a SageMath package for motions of graphs
- Generating all rigidity circuits on at most 10 vertices and all Assur graphs on at most 11 vertices
- And yet it moves: paradoxically moving linkages in kinematics
This page was built for software: LamanGraphs
