Planar Maps are Well Labeled Trees
From MaRDI portal
Publication:3050453
DOI10.4153/CJM-1981-078-2zbMath0415.05020MaRDI QIDQ3050453
Publication date: 1981
Published in: Canadian Journal of Mathematics (Search for Journal in Brave)
Related Items
A technology for reverse-engineering a combinatorial problem from a rational generating function, Limit of normalized quadrangulations: the Brownian map, Counting problems and algebraic formal power series in noncommuting variables, Une relation fonctionnelle nouvelle sur les cartes planaires pointées, Les hypercartes planaires sont des arbres très bien étiquetés. (Planar hypermaps are well-labeled trees), Relations fonctionnelles et dénombrement des cartes pointées sur le tore. (Functional relations and the enumeration of rooted genus one maps), Hypercartes pointées sur le tore: Décompositions et dénombrements. (Rooted genus one hypermaps on the torus: Decompositions and enumerations), The complexity of computing the number of strings of given length in context-free languages, Attribute grammars are useful for combinatorics, Enumeration of skew Ferrers diagrams and basic Bessel functions, Coding the convex polyominoes and equations for the enumeration according to the area, Two combinatorial statistics on Dyck paths, Algebraic languages and polyominoes enumeration, Left ternary trees and non-separable rooted planar maps, Le schéma de carte et ses applications, A combinatorial proof of J. West's conjecture, Generating functions for column-convex polyominoes, A generalization of the language of Łukasiewicz coding rooted planar hypermaps, Permutations with forbidden subsequences and nonseparable planar maps, A conditional limit theorem for tree-indexed random walk, Local limit of labeled trees and expected volume growth in a random quadrangulation, Polynomial equations with one catalytic variable, algebraic series and map enumeration, Generalized Dyck equations and multilabel trees, Limit laws for embedded trees: Applications to the integrated superBrownian excursion
