Bijective counting of plane bipolar orientations and Schnyder woods

European Journal of Combinatorics

Volumn 30, Issue 7, 2009, Pages 1646-1658

  Fusy, Éric ^a   Poulalhon, Dominique ^b   Schaeffer, Gilles ^a  

^a ECOLE POLYTECHNIQUE   (France)

^b UNIVERSITÉ PARIS DIDEROT   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 67650444337     PISSN: 01956698     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejc.2009.03.001     Document Type: Article

References (21)

1. Baxter R.J. Dichromatic polynomials and potts models summed over rooted maps. Ann. Combin. 5 (2001) 17
2. Bernardi O., and Bonichon N. Intervals in catalan lattices and realizers of triangulations. J. Combin. Theory Ser. A 116 1 (2009) 55-75
3. Biedl T., and Brandenburg F.J. Partitions of graphs into trees. Proceedings of Graph Drawing'06 (Karlsruhe). LNCS vol. 4372 (2007) 430-439
4. Bonichon N. A bijection between realizers of maximal plane graphs and pairs of non-crossing dyck paths. Discrete Math. 298 1-3 (2005) 104-114
5. N. Bonichon, M. Bousquet-Mélou, É. Fusy, Baxter permutations and plane bipolar orientations, 2008. arXiv:0805.4180
6. Bousquet-Mélou M. Four classes of pattern-avoiding permutations under one roof: Generating trees with two labels. Electron. J. Combin. (2002)
7. Brown W.G., and Tutte W.T. On the enumeration of rooted nonseparable maps. Canad. J. Math. 16 (1964) 572-577
8. Chiba N., Nishizeki T., Abe S., and Ozawa T. A linear algorithm for embedding planar graphs using p q-trees. J. Comput. Syst. Sci. 30 1 (1985) 54-76
9. De Fraysseix H., Ossona de Mendez P., and Rosenstiehl P. Bipolar orientations revisited. Discrete Appl. Math. 56 2-3 (1995) 157-179
10. Dulucq S., and Guibert O. Baxter permutations. Discrete Math. 180 (1998) 143-156
11. Felsner S. Geometric Graphs and Arrangements (2004), Vieweg Verlag
12. S. Felsner, É. Fusy, M. Noy, D. Orden, Bijections for baxter families and related objects, 2008. arXiv:0803.1546
13. Fusy É. Straight-line drawing of quadrangulations. Proceedings of Graph Drawing'06. LNCS vol. 4372 (2006), Springer 234-239
14. Gessel I., and Viennot X. Binomial determinants, paths, and hook formulae. Adv. Math. 58 (1985) 300-321
15. I. Gessel, X. Viennot, Determinants, paths, and plane partitions, Preprint, 1989
16. C. Huemer, S. Kappes, A binary labelling for plane laman graphs and quadrangulations, in: Proceedings of EWCG, Delphi, 2006, pp. 83-86
17. Kant G., and He X. Regular edge labeling of 4-connected plane graphs and its applications in graph drawing problems. Theoret. Comput. Sci. 172 1-2 (1997) 175-193
18. A. Lempel, S. Even, I. Cederbaum, An algorithm for planarity testing of graphs, in: Theory of Graphs, Int. Symp, New York, 1967, pp. 215-232
19. P. Ossona de Mendez, Orientations bipolaires, Ph.D. Thesis, Ecole des Hautes Etudes en Sciences Sociales, Paris, 1994
20. Tamassia R., and Tollis I.G. A unified approach to visibility representations of planar graphs. Discrete Comput. Geom. 1 4 (1986) 321-341
21. Tamassia R., and Tollis I.G. Planar grid embedding in linear time. IEEE Trans. Circuits Systems CAS-36 9 (1989) 1230-1234