Graphs with flexible labelings

From MaRDI portal
Publication:2316799



Abstract: For a flexible labeling of a graph, it is possible to construct infinitely many non-equivalent realizations keeping the distances of connected points constant. We give a combinatorial characterization of graphs that have flexible labelings. The characterization is based on colorings of the edges with restrictions on the cycles. Furthermore, we give necessary criteria and sufficient ones for the existence of such colorings.












This page was built for publication: Graphs with flexible labelings

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