On enumeration of tree-rooted planar cubic maps
classification
🧮 math.CO
keywords
cubicmapsmarkednumberplanartreecatalancdot
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.