Abstract.
We solve three enumerative problems concerning the families of planar maps. More precisely, we establish algebraic equations for the generating function of loopless triangulations in which all vertices have degree at least d, for a certain value d chosen in {3, 4, 5}.
The originality of the problem lies in the fact that degree restrictions are placed both on vertices and faces. Our proofs first follow Tutte’s classical approach: We decompose maps by deleting the root-edge and translate the decomposition into an equation satisfied by the generating function of the maps under consideration. Then we proceed to solve the equation obtained using a recent technique that extends the so-called quadratic method.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
Author information
Authors and Affiliations
Corresponding author
Additional information
Received January 25, 2006
Rights and permissions
About this article
Cite this article
Bernardi, O. On Triangulations with High Vertex Degree. Ann. Comb. 12, 17–44 (2008). https://doi.org/10.1007/s00026-008-0334-5
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00026-008-0334-5