A model of trees for 5-connected planar triangulations
Abstract: Triangulations of the 5-gon with no separating triangle nor quadrangle, so called 5c-triangulations, are a planar map family closely related to 5-connected planar triangulations. We show that 5c-triangulations are in bijection with 5-regular plane trees satisfying a simple local constraint at inner edges. It yields explicit expressions for the generating functions of rooted 5c-triangulations, and of rooted 5-connected planar triangulations with root-vertex degree 5, these belonging to the same algebraic extension as the generating function of rooted 5-connected planar triangulations computed by Gao, Wanless and Wormald. The bijection also makes it possible to obtain efficient uniform random generation and succinct encoding procedures for 5-connected planar triangulations.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.