In the theory of enumeration, the part devoted to the counting of planar maps gives rather surprising results. Of special interest to the combinatorialists is the conspicuous feature of counting numbers associated with families of maps as discussed in the papers of Tutte, Brown and Mullin. These formulas are by no means easy to prove; this is also a part of their charm. We are convinced therefore that these maps possess deep combinatorial properties. We discuss such properties in this paper.The main result of this article is the construction of a bisection between planar maps and a special family of trees: their vertices are labeled with numbers that differ by at most 1 on adjacent vertices. These trees are said to be well labeled. Combinatorialists usually claim that theorems specifying the “geometry” of objects lead to enumerating formulas. Our result obeys this general rule: we can indeed obtain a new proof of the formula counting the number of rooted planar maps with m edges. Four different proofs of this formula are known to date.

Abstract.We give the generating function for parallelogram polyominoes according to the bond perimeter and the site perimeter. In this last case, we give an asymptotic evaluation for their number. According to the two parameters an exact formula for their number is found which gives some numbers closed to the Narayana's numbers.

No abstract

No abstract

No abstract