• A
  • A
  • A
  • ABC
  • ABC
  • ABC
  • А
  • А
  • А
  • А
  • А
Regular version of the site

Working paper

On enumeration of tree-rooted planar cubic maps

arxiv.org. math. Cornell University, 2016. No. 1608.02510.
We consider planar cubic maps, i.e. connected cubic graphs, embedded into plane, with marked spanning tree and marked directed edge (not in this tree). The number of such objects with 2n vertices is C2n∙ Cn+1, where Ck is Catalan number.