Published March 25, 2020
| Version v2
Software
Open
Flexible and Rigid Labelings of Graphs - supporting material
Creators
- 1. Research Institute for Symbolic Computation, Johannes Kepler University Linz
Description
This is a supporting material for the thesis Flexible and Rigid Labelings of Graphs by Jan Legerský.
The computation of the list of the maximal movable graphs up to 8 vertices that are spanned by a Laman graph
and have no vertex of degree two is provided.
The classification of motions of a 7-vertex Laman graph is included with the necessary computations and animations.
This version has been updated from version 1 to run with SageMath 9.0.
Files
Flexible_and_Rigid_Labelings_of_Graphs-supporting_material.zip
Files
(1.3 MB)
| Name | Size | Download all |
|---|---|---|
|
md5:fa8aff1d1a908eab5b639d26d909397a
|
1.3 MB | Preview Download |
Additional details
Related works
- Is compiled by
- 10.5281/zenodo.3719345 (DOI)