| Binary labelings for bipartite graphs ∗ (2008) | |||||||||||||||
Abstract | |||||||||||||||
| 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. 1 | |||||||||||||||
Publication details | |||||||||||||||
| |||||||||||||||