On enumeration of tree-rooted planar cubic maps

Yury Kochetkov

On enumeration of tree-rooted planar cubic maps

Combinatorics 2016-08-09 v1

Authors: Yury Kochetkov

Abstract

We consider planar cubic maps, i.e. connected cubic graphs imbedded into plane, with marked spanning tree and marked directed edge (not in this tree). The number of such objects with $2n$ vertices is $C_{2n}\cdot C_{n+1}$ , where $C_k$ is $k$ -th Catalan number.

Keywords

bijective combinatorics phylogenetic trees incidence geometry of points and lines

Cite

@article{arxiv.1608.02510,
  title  = {On enumeration of tree-rooted planar cubic maps},
  author = {Yury Kochetkov},
  journal= {arXiv preprint arXiv:1608.02510},
  year   = {2016}
}

Comments

7 pages, 1 figure

Related papers

View all related →