A binary labeling for plane Laman graphs and quadrangulations
نویسندگان
چکیده
We present binary labelings for the angles of quadrangulations and plane Laman graphs, which are in analogy with Schnyder labelings for triangulations [W. Schnyder, Proc. 1st ACM-SIAM Symposium on Discrete Algorithms, 1990] and imply a special tree decomposition for quadrangulations. In particular, we show how to embed quadrangulations on a 2-book, so that each page contains a non-crossing alternating tree.
منابع مشابه
A binary labelling for plane Laman graphs and quadrangulations
We provide binary labellings for the angles of quadrangulations and plane Laman graphs which are in analogy with Schnyder labellings for triangulations [W. Schnyder, Proc. 1st ACM-SIAM Symposium on Discrete Algorithms, 1990].
متن کاملBinary labelings for bipartite graphs
Part of the authors introduced in [C. Huemer, S. Kappes, A binary labelling for plane Laman graphs and quadrangulations, in Proceedings of the 22nd European Workshop on Computational Geometry 83–86, 2006] a binary labeling for the angles of plane quadrangulations, similar to Schnyder labelings of the angles of plane triangulations since in both cases the labelings are equivalent to tree decompo...
متن کاملBinary Labelings for Plane Quadrangulations and their Relatives
Motivated by the bijection between Schnyder labelings of a plane triangulation and partitions of its inner edges into three trees, we look for binary labelings for quadrangulations (whose edges can be partitioned into two trees). Our labeling resembles many of the properties of Schnyder’s one for triangulations: Apart from being in bijection with tree decompositions, paths in these trees allow ...
متن کاملBalanced Degree-Magic Labelings of Complete Bipartite Graphs under Binary Operations
A graph is called supermagic if there is a labeling of edges where the edges are labeled with consecutive distinct positive integers such that the sum of the labels of all edges incident with any vertex is constant. A graph G is called degree-magic if there is a labeling of the edges by integers 1, 2, ..., |E(G)| such that the sum of the labels of the edges incident with any vertex v is equal t...
متن کاملCombinatorial and Geometric Properties of Planar Laman Graphs
Laman graphs naturally arise in structural mechanics and rigidity theory. Specifically, they characterize minimally rigid planar bar-and-joint systems which are frequently needed in robotics, as well as in molecular chemistry and polymer physics. We introduce three new combinatorial structures for planar Laman graphs: angular structures, angle labelings, and edge labelings. The latter two struc...
متن کامل