Abstract

We give a bijection between Eulerian planar maps with prescribed vertex degrees, and some plane trees that we call balanced Eulerian trees. To enumerate the latter, we introduce conjugation classes of planted plane trees. In particular the result answers a question of Bender and Canfield in [BC94] and allows uniform random generation of Eulerian planar maps with restricted vertex degrees. Using a well known correspondence between 4-regular planar maps with n vertices and planar maps with n edges we obtain an algorithm to generate uniformly such maps with complexity O(n). Our bijection is also refined to give a combinatorial interpretation of a parameterization of Arques ([Arq87]) of the generating function of planar maps with respect to vertices and faces.

Citations

112	A census of planar maps - Tutte - 1963
47	Un code pour les graphes planaires et ses applications, volume 27 of Astérisque. Société Mathématique de - Cori - 1975
15	Combinatorics on Words, vol. 17 of Encyclopedia of Mathematics and its Applications - Lothaire - 1983
14	A census of slicings - Tutte - 1962
13	Description trees for some families of planar maps - Cori, Jacquard, et al.
13	The number of plane trees - Harary, Prins, et al. - 1964
7	Relations fonctionnelles et d'enombrement des cartes point'ees sur le tore - Arqu`es - 1987
6	M'ethodes de G'en'eration Al'eatoire d'Objets Combinatoires de Grande Taille et Probl`emes d' ' Enum'eration - Denise - 1994
4	Some unsolved problems in map enumeration - Bender - 1991
3	The number of degree-restricted rooted maps on the sphere - Bender, Canfield - 1994
1	Object grammars and random generation. Submitted to Discrete Mathematics and Theoretical Computer Science. http:nnwww.compscinet.com - Dutour, F'edou