We present a bijection between the set of plane triangulations (aka maximal planar graphs) and a simple subset of the set of plane trees with two leaves adjacent to each node. The construction takesâ€¦ (More)

We present a bijection between some quadrangular dissections of an hexagon and unrooted binary trees. This correspondence has interesting consequences for enumeration, mesh compression and randomâ€¦ (More)

This article presents a unified bijective scheme between planar maps and blossoming trees, where a blossoming tree is defined as a spanning tree of the map decorated with some dangling half-edgesâ€¦ (More)

We present a bijection between some quadrangular dissections of an hexagon and unrooted binary trees with interesting consequences for enumeration, mesh compression, and graph sampling. Our bijectionâ€¦ (More)

Parking functions are central in many aspects of combinatorics. We de1ne in this communication a generalization of parking functions which we call (p1; : : : ; pk)-parking functions. We give aâ€¦ (More)

The family of well-orderly maps is a family of planar maps with the property that every connected planar graph has at least one plane embedding which is a well-orderly map.We show that the number ofâ€¦ (More)

We present the first polynomial uniform random sampling algorithm for simple branched coverings of the sphere by itself of degree n. More precisely, our algorithm generates in linear time increasingâ€¦ (More)