Euler circuits and DNA sequencing by hybridization, Discrete Applied Mathematics, vol.104, issue.1-3, pp.63-96, 2000. ,
DOI : 10.1016/S0166-218X(00)00190-6
The Asymptotic Number of Labeled Graphs with Given Degree Sequences, Journal of Combinatorial Theory, Series A, vol.24, issue.3, pp.296-307, 1978. ,
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
Two Algorithms for Unranking Arborescences, Journal of Algorithms, vol.20, issue.2, pp.268-281, 1996. ,
DOI : 10.1006/jagm.1996.0014
Counting and Sampling problems on Eulerian graphs, 2010. ,
Generating and Counting Hamilton Cycles in Random Regular Graphs, Journal of Algorithms, vol.21, issue.1, pp.176-198, 1996. ,
DOI : 10.1006/jagm.1996.0042
Random Regular Graphs: Asymptotic Distributions and Contiguity, Combinatorics, Probability and Computing, vol.534, issue.04, pp.369-405, 1995. ,
DOI : 10.1002/rsa.3240050209
Asymptotic Enumeration of Eulerian Circuits in the Complete Graph, Combinatorics, Probability & Computing, vol.7, issue.4, pp.437-449, 1998. ,
1-Factorizations of random regular graphs. Random Structures and Algorithms, pp.305-321, 1997. ,
How to Get a Perfectly Random Sample From a Generic Markov Chain and Generate a Random Spanning Tree of a Directed Graph, Journal of Algorithms, vol.27, pp.170-217, 1998. ,
2-factors in random regular graphs, Journal of Graph Theory, vol.23, issue.3, pp.215-224, 1996. ,
Almost All Cubic Graphs Are Hamiltonian, Random Structures & Algorithms, vol.3, issue.2, pp.117-126, 1992. ,
Almost All Regular Graphs Are Hamiltonian, Random Structures & Algorithms, vol.5, issue.2, pp.363-374, 1994. ,
On unicursal paths in networks of degree 4, American Mathematical Monthly, vol.48, pp.233-237, 1941. ,
Enumerative Combinatorics, 2001. ,
Graph Theory, Encyclopedia of Mathematics and it Applications, 1984. ,
Circuits and Trees in Oriented Linear Graphs, Simon Stevin, vol.28, pp.203-217, 1951. ,
DOI : 10.1007/978-0-8176-4842-8_12