Binary labelings for plane quadrangulations and their relatives

Discrete Mathematics and Theoretical Computer Science

Volumn 12, Issue 3, 2010, Pages 63-74

  Felsner, Stefan ^a   Huemer, Clemens ^b   Kappes, Sarah ^a   Orden, David ^c  

^a TECHNISCHE UNIVERSITÄT BERLIN   (Germany)

^b UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

^c UNIVERSITY OF ALCALÁ   (Spain)

Author keywords

Book embedding; Laman graph; Pseudo triangulation; Quadrangulation; Schnyder labeling

Indexed keywords

BOOK EMBEDDING; LAMAN GRAPH; PSEUDO-TRIANGULATION; QUADRANGULATION; SCHNYDER LABELING;

BINARY TREES; GRAPH THEORY; TRIANGULATION;

TREES (MATHEMATICS);

EID: 78649542194     PISSN: 14627264     EISSN: 13658050     Source Type: Journal    
DOI: None     Document Type: Article

References (22)

1. O. Aichholzer, F. Aurenhammer, P. Gonzalez-Nava, T. Hackl, C. Huemer, F. Hurtado, H. Krasser, S. Ray, B. Vogtenhuber. Matching edges and faces in polygonal partitions. Computational Geometry: Theory and Applications 39: 134-141, 2008.
2. E. Brehm. 3-orientations and Schnyder 3-tree-decompositions. Diplomarbeit, Freie Universität Berlin, Germany, 2000.
3. N. Bonichon, S. Felsner, M. Mosbah. Convex drawings of 3-connected planar graphs. Algorithmica 47: 399-420, 2007.
4. V. Dujmovic, D.R. Wood. On linear layouts of graphs. Discrete Mathematics and Theoretical Computer Science 6: 339-358, 2004.
5. S. Felsner. Convex Drawings of Planar Graphs and the Order Dimension of 3-Polytopes. Order 18: 19-37, 2001.
6. S. Felsner. Lattice Structure from Planar Graphs. Electronic Journal of Combinatorics 11: 1R15, 2004.
7. S. Felsner, É. Fusy, M. Noy, D. Orden Bijections for Baxter Families and Related Objects. Journal of Combinatorial Theory, Series A Article in Press, 2010. DOI:10.1016/j.jcta.2010.03.017
8. H. de Fraysseix, P. Ossona de Mendez. On topological aspects of orientations. Discrete Mathematics 229: 57-72, 2001.
9. H. de Fraysseix, P. Ossona de Mendez, J. Pach. A left-first search algorithm for planar graphs. Discrete Computational Geometry 13: 459-468, 1995.
10. H. de Fraysseix, P. Ossona de Mendez, P. Rosenstiehl. Bipolar orientations revisited. Discrete Applied Mathematics 56: 157-179, 1995.
11. I. M. Gelfand, M. I. Graev, A. Postnikov. Combinatorics of hypergeometric functions associated with positive roots. In V. I. Arnold et al. (ed.) The Arnold-Gelfand Mathematical Seminars: Geometry and Singularity Theory, 205-221, Boston, 1997.
12. C. Huemer, S. Kappes. A binary labelling for plane Laman graphs and quadrangulations. 22nd European Workshop on Computational Geometry, pages 83-86, Delphi, Greece, 2006.
13. A. S. Lladó, S. C. López Masip. Decompositions of graphs with a given tree. In Actas de las III Jornadas de Matemática Discreta y Algorítmica, 204-211, Sevilla, Spain, 2002.
14. G. L. Miller and J. Naor. Flow in planar graphs with multiple sources and sinks. SIAM Journal on Computing 24: 1002-1017, 1995.
15. A. Nakamoto, M. Watanabe. Cycle reversals in oriented plane quadrangulations and orthogonal plane partitions. Journal of Geometry 68: 200-208, 2000.
16. P. Ossona de Mendez. Orientations bipolaires. Ph.D. thesis, Ecole des Hautes Etudes en Sciences Sociales, Paris, France, 1994.
17. V. Petrovíc. Decomposition of some planar graphs into trees. Discrete Mathematics 150: 449-451, 1996.
18. G. Ringel. Two Trees in Maximal Planar Bipartite Graphs. Journal of Graph Theory 17: 755-758, 1993.
19. G. Rote, F. Santos, I. Streinu. Expansive motions and the polytope of pointed pseudo-triangulations. In Discrete and Computational Geometry-The Goodman-Pollack Festschrift, 699-736. Algorithms and Combinatorics, vol. 25. Springer 2003.
20. W. Schnyder. Planar graphs and poset dimension. Order 5: 323-343, 1989.
21. W. Schnyder. Embedding planar graphs on the grid. In Proceedings of the 1st ACM-SIAM Symposium on Discrete Algorithms 138-148, 1990.
22. T. Ueckerdt. Complexity of Orientations. in preparation.