Counting 5-connected planar triangulations

Research output: Contribution to journalArticleResearchpeer-review

6 Citations (Scopus)


Let t n be the number of rooted 5-connected planar triangulations with 2n faces. We find t n exactly for small n, as well as an asymptotic formula for n → ∞. Our results are found by compositions of lower connectivity maps whose faces are triangles or quadrangles. We also find the asymptotic number of cyclically 5-edge connected cubic planar graphs.

Original languageEnglish
Pages (from-to)18-35
Number of pages18
JournalJournal of Graph Theory
Issue number1
Publication statusPublished - Sept 2001
Externally publishedYes


  • 5-connected
  • Cubic graph
  • Enumeration
  • Planner map
  • Triangulation

Cite this