References
- B. Bollobas, A probabilistic proof of an asymptotic formula for the number of labelled regular graphs, European J. Combin. 1 (1980), no. 4, 311-316 https://doi.org/10.1016/S0195-6698(80)80030-8
- G. Chae, Asymptotic number of general cubic graphs with given connectivity, J. Korean Math. Soc. 42 (2005), no. 6, 1187-1203 https://doi.org/10.4134/JKMS.2005.42.6.1187
- G. Chae, Inclusion and Exclusion for finitely many types of properties, preprint
- G. Chartrand and L. Lesniak, Graphs & digraphs, Chapman & Hall, 2-6 Boundary Row, London, 1996
- B. D. McKay, E. M. Palmer, R. C. Read, and R. W. Robinson, The asymptotic number of claw-free cubic graphs, Discrete Math. 272 (2003), no. 1, 107-118 https://doi.org/10.1016/S0012-365X(03)00188-2
- E. M. Palmer, Graphical evolution, John Wiley & Sons, 1985
- N. C. Wormald, Some problems in the enumeration of labelled graphs, Doctoral Thesis, University of Newcastle, NSW, Australia, 1978
- N. C. Wormald, The asymptotic connectivity of labelled regular graphs, J. Combin. Theory Ser. B 31 (1981), no. 2, 156-167
-
B. D. Mckay and N. C. Wormald, Asymptotic enumeration by degree sequence of graphs with degree o(
$n^{1/2}$ ), Combinatorica 11 (1991), no. 4, 369-382 https://doi.org/10.1007/BF01275671
Cited by
- INCLUSION AND EXCLUSION FOR FINITELY MANY TYPES OF PROPERTIES vol.32, pp.1, 2010, https://doi.org/10.5831/HMJ.2010.32.1.113