On the Classification of Motions of Paradoxically Movable Graphs

03/25/2020
by   Georg Grasegger, et al.
0

Edge lengths of a graph are called flexible if there exist infinitely many non-congruent realizations of the graph in the plane satisfying these edge lengths. It has been shown recently that a graph has flexible edge lengths if and only if the graph has a special type of edge coloring called NAC-coloring. We address the question how to determine all possible proper flexible edge lengths from the set of all NAC-colorings of a graph. We do so using restrictions to 4-cycle subgraphs.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

08/24/2020

Odd wheels are not odd-distance graphs

An odd wheel graph is a graph formed by connecting a new vertex to all v...
08/01/2019

On the existence of paradoxical motions of generically rigid graphs on the sphere

We interpret realizations of a graph on the sphere up to rotations as el...
04/19/2021

On sublinear approximations for the Petersen coloring conjecture

If f:ℕ→ℕ is a function, then let us say that f is sublinear if lim_...
04/04/2019

Normal 5-edge-colorings of a family of Loupekhine snarks

In a proper edge-coloring of a cubic graph an edge uv is called poor or ...
04/15/2020

Complete Edge-Colored Permutation Graphs

We introduce the concept of complete edge-colored permutation graphs as ...
05/05/2022

New Techniques Based On Odd-Edge Total Colorings In Topological Cryptosystem

For building up twin-graphic lattices towards topological cryptograph, w...
11/16/2018

Spectrum graph coloring to improve Wi-Fi channel assignment in a real-world scenario via edge contraction

The present work deals with the problem of efficiently assigning Wi-Fi c...

Code Repositories

flexrilog

SageMath package for studying Flexible and Rigid Labelings of Graphs


view repo
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.