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 decompositions. In this paper we analyze an extension of the above labelings to a class of 2-connected bipartite graphs, similar to the extension of Schnyder labelings to 3-connected plane graphs.
منابع مشابه
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...
متن کامل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 ...
متن کاملOn the cyclic decomposition of circulant graphs into bipartite graphs
It is known that if a bipartite graph G with n edges possesses any of three types of ordered labelings, then the complete graphK2nx+1 admits a cyclic G-decomposition for every positive integer x. We introduce variations of the ordered labelings and show that whenever a bipartite graph G admits one of these labelings, then there exists a cyclic G-decomposition of an infinite family of circulant ...
متن کاملΓ-labelings of Complete Bipartite Graphs
Explicit formulae for the γ-min and γ-max labeling values of complete bipartite graphs are given, along with γ-labelings which achieve these extremes. A recursive formula for the γ-min labeling value of any complete multipartite is also presented.
متن کاملSparse anti-magic squares and vertex-magic labelings of bipartite graphs
A sparse anti-magic square is an n×n array whose non-zero entries are the consecutive integers 1, · · · ,m for some m ≤ n and whose rowsums and column-sums form a set of consecutive integers. We derive some basic properties of these arrays and provide constructions for several infinite families of them. Our main interest in these arrays is their application to constructing vertex-magic labeling...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007