Graphs with flexible labelings allowing injective realizations

From MaRDI portal
Publication:2174572

DOI10.1016/J.DISC.2019.111713zbMATH Open1437.05206arXiv1811.06709OpenAlexW2901405133WikidataQ114190672 ScholiaQ114190672MaRDI QIDQ2174572FDOQ2174572


Authors: Georg Grasegger, Jan Legerský, Josef Schicho Edit this on Wikidata


Publication date: 21 April 2020

Published in: Discrete Mathematics (Search for Journal in Brave)

Abstract: We consider realizations of a graph in the plane such that the distances between adjacent vertices satisfy the constraints given by an edge labeling. If there are infinitely many such realizations, counted modulo rigid motions, the labeling is called flexible. The existence of a flexible labeling, possibly non-generic, has been characterized combinatorially by the existence of a so called NAC-coloring. Nevertheless, the corresponding realizations are often non-injective. In this paper, we focus on flexible labelings with infinitely many injective realizations. We provide a necessary combinatorial condition on existence of such a labeling based also on NAC-colorings of the graph. By introducing new tools for the construction of such labelings, we show that the necessary condition is also sufficient up to 8 vertices, but this is not true in general for more vertices.


Full work available at URL: https://arxiv.org/abs/1811.06709




Recommendations




Cites Work


Cited In (12)

Uses Software





This page was built for publication: Graphs with flexible labelings allowing injective realizations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2174572)