Brown's theorem and its application for enumeration of dissections and planar trees
The electronic journal of combinatorics, Tome 22 (2015) no. 1
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

We present new functional equations connecting the counting series of plane and planar (in the sense of Harary and Palmer) dissections. Simple rigorous expressions for counting symmetric $r$-dissections of polygons and planar $S$-dissections are obtained.
DOI : 10.37236/4129
Classification : 05C30, 05A15, 05C10, 05C05
Mots-clés : planar dissections, plane trees, enumeration

Evgeniy Krasko  1   ; Alexander Omelchenko  1

1 St.Petersburg Academic University
@article{10_37236_4129,
     author = {Evgeniy Krasko and Alexander Omelchenko},
     title = {Brown's theorem and its application for enumeration of dissections and planar trees},
     journal = {The electronic journal of combinatorics},
     year = {2015},
     volume = {22},
     number = {1},
     doi = {10.37236/4129},
     zbl = {1307.05117},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/4129/}
}
TY  - JOUR
AU  - Evgeniy Krasko
AU  - Alexander Omelchenko
TI  - Brown's theorem and its application for enumeration of dissections and planar trees
JO  - The electronic journal of combinatorics
PY  - 2015
VL  - 22
IS  - 1
UR  - http://geodesic.mathdoc.fr/articles/10.37236/4129/
DO  - 10.37236/4129
ID  - 10_37236_4129
ER  - 
%0 Journal Article
%A Evgeniy Krasko
%A Alexander Omelchenko
%T Brown's theorem and its application for enumeration of dissections and planar trees
%J The electronic journal of combinatorics
%D 2015
%V 22
%N 1
%U http://geodesic.mathdoc.fr/articles/10.37236/4129/
%R 10.37236/4129
%F 10_37236_4129
Evgeniy Krasko; Alexander Omelchenko. Brown's theorem and its application for enumeration of dissections and planar trees. The electronic journal of combinatorics, Tome 22 (2015) no. 1. doi: 10.37236/4129

Cité par Sources :