Counting 5-connected planar triangulations

Journal of Graph Theory

Volumn 38, Issue 1, 2001, Pages 18-35

  Gao, Zhicheng J ^a   Wanless, Ian M ^b,c   Wormald, Nicholas C ^b,d  

^a CARLETON UNIVERSITY   (Canada)

^b UNIVERSITY OF MELBOURNE   (Australia)

^c CHRIST CHURCH   (United Kingdom)

^d AUSTRALIAN RESEARCH COUNCIL   (Australia)

Author keywords

5 connected; Cubic graph; Enumeration; Planner map; Triangulation

Indexed keywords

EID: 31244436891     PISSN: 03649024     EISSN: None     Source Type: Journal    
DOI: 10.1002/jgt.1021     Document Type: Article

References (17)

1. E. A. Bender, Asymptotic methods in enumeration, SIAM Rev 16 (1974), 485-515.
2. E. A. Bender and E. R. Canfield, The number of degree-restricted rooted maps on the sphere, SIAM J Discrete Math 7 (1994), 9-15.
3. G. Brinkmann and B. D. McKay, Construction of planar triangulations with minimum degree 5, (in preparation).
4. W. G. Brown, Enumeration of triangulations of the disk, Proc London Math Soc 14 (1964), 746-768.
5. W. G. Brown, Enumeration of quadrangular dissections of the disk, Canad J Math 17 (1965), 302-317.
6. W. G. Brown, On the existence of square roots in certain rings of power series, Math Ann 158 (1965), 82-89.
7. E. R. Canfield, Remarks on an asymptotic method in combinatorics, J Combin Theory Ser A 37 (1984), 348-352.
8. Z. C. Gao, The number of rooted triangular maps on a surface, J Combin Theory Ser B 52 (1991), 236-249.
9. Z. C. Gao and N. C. Wormald, Enumeration of rooted planar cubic maps, Annals of Combinatorics (to appear).
10. R. C. Mullin, On counting rooted triangular maps, Canad J Math 17 (1965), 373-382.
11. R. C. Mullin and P. J. Schellenberg, The enumeration of c-nets via quadrangulations, J Combin Theory 4 (1968), 259-276.
12. L. B. Richmond and N. C. Wormald, Almost all maps are asymmetric, J Combin Theory Ser B 63 (1995), 1-7.
13. T. L. Saaty and P. C. Kainen, The four-color problem, Assaults and conquest, McGraw-Hill, New York, 1977.
14. W. T. Tutte, A census of planar triangulations, Canad J Math 14 (1962), 21-38.
15. W. T. Tutte, A census of planar maps, Canad J Math 15 (1963), 249-271.
16. H. Whitney, 2-isomorphic graphs, Am J Math 55 (1933), 245-254.
17. N. C. Wormald, Enumeration of labelled graphs I: 3-connected graphs, J London Math Soc (2) 19 (1979), 7-12.