Contents

Ars Combinatoria

  • Research article

Enumeration of rooted biloopless nonseparable planar near-triangulations

Shude Long1, Junliang Cai2
1Department of Mathematics, Chongqing University of Arts and Sciences, Chongqing, 402160, P.R.China
2School of Mathematical Sciences, Beijing Normal University, Beijing 100875, P.R.China
  • Accepted: 30/06/2024
  • Published Online: 22/03/2025

Abstract

This paper investigates the number of rooted biloopless nonseparable planar near-triangulations and presents some formulae for such maps with three parameters: the valency of root-face, the number of edges and the number of inner faces. All of them are almost summation-free.

Keywords: map, triangulation, enumerating function, functional equation, Lagrangian inversion
Information
Guidelines
CP Initiatives
Follow CP
Facebook X-twitter Linkedin

1970-2025 CP (Manitoba, Canada) unless otherwise stated.

Citation
Shude Long, Junliang Cai. Enumeration of rooted biloopless nonseparable planar near-triangulations[J], Ars Combinatoria, Volume 162. 93-102. https://doi.org/10.61091/ars162-08.