1 |
N. C. Wormald, The asymptotic connectivity of labelled regular graphs, J. Combin. Theory Ser. B 31 (1981), no. 2, 156-167
|
2 |
N. C. Wormald, Some problems in the enumeration of labelled graphs, Doctoral Thesis, University of Newcastle, NSW, Australia, 1978
|
3 |
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
DOI
|
4 |
G. Chae, Inclusion and Exclusion for finitely many types of properties, preprint
|
5 |
G. Chartrand and L. Lesniak, Graphs & digraphs, Chapman & Hall, 2-6 Boundary Row, London, 1996
|
6 |
E. M. Palmer, Graphical evolution, John Wiley & Sons, 1985
|
7 |
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
DOI
ScienceOn
|
8 |
B. D. Mckay and N. C. Wormald, Asymptotic enumeration by degree sequence of graphs with degree o( ), Combinatorica 11 (1991), no. 4, 369-382
DOI
|
9 |
G. Chae, Asymptotic number of general cubic graphs with given connectivity, J. Korean Math. Soc. 42 (2005), no. 6, 1187-1203
DOI
ScienceOn
|