Software Open Access

Flexible and Rigid Labelings of Graphs - supporting material

Jan Legerský

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 (1.3 MB)
Name Size
1.3 MB Download
All versions This version
Views 6936
Downloads 2812
Data volume 45.1 MB16.2 MB
Unique views 5227
Unique downloads 2310


Cite as