Left ternary trees and non-separable rooted planar maps

Theoretical Computer Science

Volumn 233, Issue 1-2, 2000, Pages 201-215

  Del Lungo, Alberto ^a   Del Ristoro, Francesco ^a   Penaud, Jean Guy ^b  

^a UNIVERSITY OF FLORENCE   (Italy)

^b UNIVERSITÉ DE BORDEAUX   (France)

Author keywords

Bijective proof; Left trees; Non separable rooted planar maps; Overturning operation

Indexed keywords

EID: 0141555830     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0304-3975(98)00025-5     Document Type: Article

References (10)

1. E. Barcucci, A. Del Lungo, E. Pergola, R. Pinzani, Towards a methodology for tree enumeration, Proc. 7th FPSAC, Marne-la-Vallée, 1995, pp. 53-65.
2. W.G. Brown, Enumeration of nonseparable planar maps, Canad. J. Math. 15 (1963) 526-545.
3. R. Cori, Une code pour les graphes planaires et ses apllications, Astérisque, Société Math. de France 27 (1975).
4. R. Cori, B. Vauquelin, Planar maps are well labeled trees, Canad J. Math. 33 (5) (1981) 1023-1042.
5. R. Cori, Bijective census of rooted planar maps - a survey, Proc. 6th FPSAC, Firenze, 1993, pp. 131-141.
6. I.P. Goulden, D.N. Jackson, Combinatorial Enumeration, Wiley, New York, 1993.
7. I.P. Goulden, J. West, Raney paths and a combinatorial relationship between rooted nonseparable planar maps and two-stack-sortable permutations, J. Combin. Theory (A), to appear.
8. B. Jacquard, G. Schaeffer, Three families of trees and nonseparable planar maps, private comunication.
9. D.E. Knuth, The Art of Computer Programming, vol. 1, 2nd ed., (Addison-Wesley, Reading, MA, 1973.
10. W.T. Tutte, A census of planar maps, Canad. J. Math. 15 (1963) 249-271.