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.

 

Files (1.8 MB)
Name Size
Flexible_and_Rigid_Labelings_of_Graphs_supporting_material.zip
md5:4278c3c380edb6aac686c3fc8379d348
1.8 MB Download
7
5
views
downloads
All versions This version
Views 77
Downloads 55
Data volume 9.0 MB9.0 MB
Unique views 77
Unique downloads 55

Share

Cite as