B. Bollobás, A Probabilistic Proof of an Asymptotic Formula for the Number of Labelled Regular Graphs, European Journal of Combinatorics, vol.1, issue.4, pp.311-316, 1980.
DOI : 10.1016/S0195-6698(80)80030-8

C. Cooper and A. M. Frieze, The Cover Time of Random Regular Graphs, SIAM Journal on Discrete Mathematics, vol.18, issue.4, pp.728-740, 2005.
DOI : 10.1137/S0895480103428478

C. Cooper and A. M. Frieze, The cover time of the giant component of a random graph, Random Structures and Algorithms, pp.401-439, 2008.

D. Coppersmith, U. Feige, and J. Shearer, Random Walks on Regular and Irregular Graphs, SIAM Journal on Discrete Mathematics, vol.9, issue.2, pp.301-308, 1996.
DOI : 10.1137/S0895480193260595

U. Feige, A tight upper bound for the cover time of random walks on graphs, Random Structures and Algorithms, pp.51-54, 1995.

U. Feige, A tight lower bound for the cover time of random walks on graphs, Random Structures and Algorithms, pp.433-438, 1995.

U. Feige, Collecting coupons on trees, and the cover time of random walks, Computational Complexity, vol.4, issue.No. 4, pp.341-356, 1996.
DOI : 10.1007/BF01270386

B. Mckay and N. Wormald, Asymptotic enumeration by degree sequence of graphs with degrees o, Combinatorica, issue.12, pp.11-369, 1991.

J. D. Kahn, N. Linial, N. Nisan, and M. E. Saks, On the cover time of random walks on graphs, Journal of Theoretical Probability, vol.2, issue.1, pp.121-128, 1989.
DOI : 10.1007/BF01048274

A. Sinclair, Improved Bounds for Mixing Rates of Markov Chains and Multicommodity Flow, Combinatorics, Probability and Computing, vol.11, issue.04, pp.351-370, 1992.
DOI : 10.1016/0095-8956(89)90029-4