Abstract
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 language | English |
---|---|
Pages (from-to) | 18-35 |
Number of pages | 18 |
Journal | Journal of Graph Theory |
Volume | 38 |
Issue number | 1 |
DOIs | |
Publication status | Published - Sept 2001 |
Externally published | Yes |
Keywords
- 5-connected
- Cubic graph
- Enumeration
- Planner map
- Triangulation