Counting 5-connected planar triangulations

DOI10.1002/jgt.1021zbMath0983.05052OpenAlexW4249130889MaRDI QIDQ2746482

Ian M. Wanless, Nicholas C. Wormald, Zhi-Cheng Gao

Publication date: 16 April 2002

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.1021

zbMATH Keywords

generating functionplanar triangulation

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Planar graphs; geometric and topological aspects of graph theory (05C10) Connectivity (05C40)

Related Items (2)

Polynomial equations with one catalytic variable, algebraic series and map enumeration ⋮ Construction of planar triangulations with minimum degree 5

Cites Work

• Unnamed Item
• Remarks on an asymptotic method in combinatorics
• The number of rooted triangular maps on a surface
• Almost all maps are asymmetric
• On the existence of square roots in certain rings of power series
• A Census of Planar Triangulations
• Asymptotic Methods in Enumeration
• Enumeration of Labelled Graphs I: 3-Connected Graphs
• The Number of Degree-Restricted Rooted Maps on the Sphere
• 2-Isomorphic Graphs
• Enumeration of Triangulations of the Disk
• Enumeration of Quadrangular Dissections of the Disk
• On Counting Rooted Triangular Maps
• The enumeration of c-nets via quadrangulations
• A Census of Planar Maps

This page was built for publication: Counting 5-connected planar triangulations