Bijections for Baxter families and related objects

Journal of Combinatorial Theory. Series A

Volumn 118, Issue 3, 2011, Pages 993-1020

  Felsner, Stefan ^a   Fusy, Éric ^b   Noy, Marc ^c   Orden, David ^d  

^a TECHNISCHE UNIVERSITÄT BERLIN   (Germany)

^b ÉCOLE POLYTECHNIQUE   (France)

^c UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

^d UNIVERSITY OF ALCALÁ   (Spain)

Author keywords

Baxter numbers; Bijections; Catalan numbers; Orientations of planar maps; Schnyder woods

Indexed keywords

EID: 78751585244     PISSN: 00973165     EISSN: 10960899     Source Type: Journal    
DOI: 10.1016/j.jcta.2010.03.017     Document Type: Article

References (41)

1. Ackerman E., Barequet G., Pinter R. On the number of rectangulations of a planar point set. J. Combin. Theory Ser. A 2006, 113:1072-1091.
2. Bárány I., Rote G. Strictly convex drawings of planar graphs. Doc. Math. 2006, 11:369-391.
3. Baxter R.J. Dichromatic polynomials and Potts models summed over rooted maps. Ann. Comb. 2001, 5:17.
4. Bernardi O., Bonichon N. Intervals in Catalan lattices and realizers of triangulations. J. Combin. Theory Ser. A 2009, 116(1):55-75.
5. Bonichon N. A bijection between realizers of maximal plane graphs and pairs of non-crossing Dyck paths. Discrete Math. 2005, 298:104-114.
6. Bonichon N., Felsner S., Mosbah M. Convex drawings of 3-connected planar graphs. Algorithmica 2007, 47:399-420.
7. N. Bonichon, M. Bousquet-Mélou, É. Fusy, Baxter permutations and plane bipolar orientations, Sém. Lothar. Combin. 61A (2010), Article B61Ah, 29 pages.
8. Brightwell G., Trotter W.T. The order dimension of convex polytopes. SIAM J. Discrete Math. 1993, 6:230-245.
9. Chung F., Graham R., Hoggatt V., Kleiman M. The number of Baxter permutations. J. Combin. Theory Ser. A 1978, 24:382-394.
10. Cori R., Dulucq S., Viennot G. Shuffle of parenthesis systems and Baxter permutations. J. Combin. Theory Ser. A 1986, 43:1-22.
11. de Fraysseix H., de Mendez P.O. On topological aspects of orientation. Discrete Math. 2001, 229:57-72.
12. de Fraysseix H., de Mendez P.O., Pach J. A left-first search algorithm for planar graphs. Discrete Comput. Geom. 1995, 13:459-468.
13. de Fraysseix H., Ossona de Mendez P., Rosenstiehl P. Bipolar orientations revisited. Discrete Appl. Math. 1995, 56:157-179.
14. P.O. de Mendez, Orientations bipolaires, PhD thesis, École des Hautes Études en Sciences Sociales, Paris, 1994.
15. Dulucq S., Guibert O. Stack words, standard tableaux and Baxter permutations. Discrete Math. 1996, 157:91-106.
16. Dulucq S., Guibert O. Baxter permutations. Discrete Math. 1998, 180:143-156.
17. Felsner S., Huemer C., Kappes S., Orden D. Binary labelings for plane quadrangulations and their relatives arxiv:math.CO/0612021.
18. Felsner S., Kappes S. Orthogonal surfaces and their CP-orders. Order 2008, 25:19-47.
19. Felsner S., Zickfeld F. On the number of planar orientations with prescribed degrees. Electron. J. Combin. 2008, 15(R77):41.
20. Fusy É. Straight-line drawing of quadrangulations. Lecture Notes in Comput. Sci. 2007, vol. 4372:234-239.
21. É. Fusy, D. Poulalhon, and G.Schaeffer, Dissections, orientations, and trees, with applications to optimal mesh encoding and to random sampling, Trans. Algorithms 4 (2008), Article 19.
22. Fusy É., Poulalhon D., Schaeffer G. Bijective counting of plane bipolar orientations and Schnyder woods. European J. Combin. 2009, 30:1646-1658.
23. Gelfand I., Graev M., Postnikov A. Combinatorics of hypergeometric functions associated with positive roots. The Arnold-Gelfand Mathematical Seminars: Geometry and Singularity Theory 1997, 205-221. Birkhäuser. V.I. Arnold (Ed.).
24. Gessel I., Viennot G. Binomial determinants, paths, and hook length formulae. Adv. Math. 1985, 58:300-321.
25. Guibert O., Linusson S. Doubly alternating Baxter permutations are Catalan. Discrete Math. 2000, 217:157-166.
26. Hartman I.B.-H., Newman I., Ziv R. On grid intersection graphs. Discrete Math. 1991, 87:41-52.
27. Kant G., He X. Regular edge labeling of 4-connected plane graphs and its applications in graph drawing problems. Theoret. Comput. Sci. 1997, 172:175-193.
28. Lin C., Lu H., Sun I.-F. Improved compact visibility representation of planar graphs via Schnyder's realizer. SIAM J. Discrete Math. 2004, 18:19-29.
29. MacMahon P.A. Combinatorial Analysis, vols. 1 and 2 1915, Cambridge University Press, reprinted by Chelsea, 1960.
30. Mallows C. Baxter permutations rise again. J. Combin. Theory Ser. A 1979, 27:394-396.
31. Narayana T.V. Sur les treillis formés par les partitions d'une unties et leurs applications á la théorie des probabilités. C. R. Math. Acad. Sci. Paris 1955, 240:1188-1189.
32. Poulalhon D., Schaeffer G. Optimal coding and sampling of triangulations. Algorithmica 2006, 46(3-4):505-527.
33. Rosenstiehl P., Tarjan R.E. Rectilinear planar layouts and bipolar orientations of planar graphs. Discrete Comput. Geom. 1986, 1(4):343-353.
34. Rote G., Streinu I., Santos F. Expansive motions and the polytope of pointed pseudo-triangulations. Discrete Comput. Geom. 2003, 699-736. Springer.
35. Schnyder W. Planar graphs and poset dimension. Order 1989, 5:323-343.
36. W. Schnyder, Embedding planar graphs on the grid, in: Proc. 1st ACM-SIAM Symp. Discr. Algo., 1990, pp. 138-148.
37. Sloane N.J.A. The on-line encyclopedia of integer sequences http://www.research.att.com/~njas/sequences.
38. Stanley R.P. Enumerative Combinatorics, vol. 2 1999, Cambridge University Press.
39. Tamassia R., Tollis I.G. A unified approach to visibility representations of planar graphs. Discrete Comput. Geom. 1986, 1(4):321-341.
40. Tamassia R., Tollis I.G. Planar grid embedding in linear time. IEEE Trans. Circuits Syst. 1989, CAS-36(9):1230-1234.
41. Yannakakis M. Embedding planar graphs in four pages. J. Comput. System Sci. 1986, 38:36-67.