This is a SageMath package for studying flexible and rigid labelings of graphs. It implements the concepts described in the papers Graphs with Flexible Labelings (doi:10.1007/s00454-018-0026-9) and Graphs with Flexible Labelings allowing Injective Realizations (doi:10.1016/j.disc.2019.111713) by Georg Grasegger, Jan Legerský and Josef Schicho, and in the doctoral thesis Flexible and Rigid Labelings of Graphs by Jan Legerský (available here). The latest version of the code can be found in the GitHub repository: https://github.com/Legersky/flexrilogThis project has received funding from the European Union's Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie grant agreement No 675789. The project was partially s...
The graphael system implements several traditional force-directed layout methods, as well as several...
A graph labeling is an assignment of integers to the vertices or edges or both subject to certain co...
In this note we present a few open problems on various aspects of graph labelings, which have not be...
This is a SageMath package for studying flexible and rigid labelings of graphs. It implements the c...
Rigiditätstheorie untersucht ebene und räumliche Realisierungen von Graphen, die gegebenen Bedingung...
AbstractTensegrity frameworks are defined on a set of points in Rd and consist of bars, cables, and ...
RigiComp is a collection of functions for combinatorial rigidity theory. In particular it contains c...
Labelling problems are very useful in modelling, solving problems in other areas and enhance the stu...
We propose FlexGD, a force-directed algorithm for straightline undirected graph drawing. The algorit...
Tensegrity frameworks are defined on a set of points in Rd and consist of bars, cables, and struts, ...
Calligraphs.wl is a mathematica package implementing the algorithms described in the paper "Coupler ...
The concept of a graph labeling is an active area of research in graph theory which has rigorous app...
We show that any graph that is generically globally rigid in ℝd has a realization in ℝd both generic...
A graph labeling is an assignment of integers to the vertices or edges, or both, subject to certain ...
This book depicts graph labelings that have led to thought-provoking problems and conjectures. Probl...
The graphael system implements several traditional force-directed layout methods, as well as several...
A graph labeling is an assignment of integers to the vertices or edges or both subject to certain co...
In this note we present a few open problems on various aspects of graph labelings, which have not be...
This is a SageMath package for studying flexible and rigid labelings of graphs. It implements the c...
Rigiditätstheorie untersucht ebene und räumliche Realisierungen von Graphen, die gegebenen Bedingung...
AbstractTensegrity frameworks are defined on a set of points in Rd and consist of bars, cables, and ...
RigiComp is a collection of functions for combinatorial rigidity theory. In particular it contains c...
Labelling problems are very useful in modelling, solving problems in other areas and enhance the stu...
We propose FlexGD, a force-directed algorithm for straightline undirected graph drawing. The algorit...
Tensegrity frameworks are defined on a set of points in Rd and consist of bars, cables, and struts, ...
Calligraphs.wl is a mathematica package implementing the algorithms described in the paper "Coupler ...
The concept of a graph labeling is an active area of research in graph theory which has rigorous app...
We show that any graph that is generically globally rigid in ℝd has a realization in ℝd both generic...
A graph labeling is an assignment of integers to the vertices or edges, or both, subject to certain ...
This book depicts graph labelings that have led to thought-provoking problems and conjectures. Probl...
The graphael system implements several traditional force-directed layout methods, as well as several...
A graph labeling is an assignment of integers to the vertices or edges or both subject to certain co...
In this note we present a few open problems on various aspects of graph labelings, which have not be...