Asymptotic Enumeration of Eulerian Circuits in the Complete Graph

Combinatorics Probability and Computing

Volumn 7, Issue 4, 1998, Pages 437-449

  Mckay, Brendan D ^a   Robinson, Robert W ^b  

^a AUSTRALIAN NATIONAL UNIVERSITY   (Australia)

^b University of Georgia ^*  (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0542423544     PISSN: 09635483     EISSN: None     Source Type: Journal    
DOI: 10.1017/S0963548398003642     Document Type: Article

References (19)

1. van Aardenne-Ehrenfest, T. and de Bruijn, N. G. (1951) Circuits and trees in oriented linear graphs. Simon Stevin 28 203-217.
2. Biggs, N. L., Lloyd, E. K. and Wilson, R. J. (1976) Graph Theory 1736-1936, Clarendon Press, Oxford.
3. Euler, L. (1736) Solutio problematis ad geometriam situs pertinentis. Comm. Acad. Sci. Imperialis Petropolitanae 8 128-140.
4. Hierholzer, C. (1873) Über die Möglichkeit, einen Linienzug ohne Wiederholung und ohne Unterbrechnung zu umfahren. Math. Ann. 6 30-32.
5. Janson, S. (1995) Personal communication.
6. Lancaster, P. and Tismenetsky, M. (1995) The Theory of Matrices, Academic Press, Orlando.
7. Las Vergnas, M. (1983) Le polynôme de Martin d'un graphe eulérian. Ann. Discrete Math. 17 397-411.
8. Liskovets, V. A. (1971) The number of Eulerian digraphs and regular tournaments (in Russian). Vescī Akad. Navuk BSSR Ser. Fīz.-Mat. Navuk. 22-27.
9. Lucas, É. (1894) Récréations Mathématiques, Vol. IV, Gauthier-Villars, Paris; Reprinted by Blanchard, Paris, 1960.
10. McKay, B.D. (1983) Applications of a technique for labelled enumeration. Congr. Numer. 40 207-221.
11. McKay, B.D. (1990) The asymptotic number of regular tournaments, Eulerian digraphs and Eulerian oriented graphs. Combinatorica 10 367-377.
12. Reiss, M. (1871-3) Evaluation du nombre de combinaisons desquelles les 28 dés d'un jeu du domino sont susceptibles d'après la règle de ce jeu. Ann. Mat. Pura Appl. 5 63-120.
13. Shishov, V.S. and Thuan, Ho Ba (1968) Remarks on Tarry's method of calculating Eulerian cycles (in Russian). Kibernetika 4 76-80; Translation in Cybernetics 4 (1968) 65-68.
14. Shishov, V.S. and Thuan, Ho Ba (1968) Remarks on Tarry's method of calculating Eulerian cycles (in Russian). Kibernetika 4 76-80; Translation in Cybernetics 4 (1968) 65-68.
15. Smith, C. A. B. and Tutte, W.T. (1941) On unicursal paths in a network of degree 4. Amer. Math. Monthly 48 233-237.
16. n (in Russian). Uspekhi Mat. Nauk 24 191-192.
17. e Session (Nancy, 1886), Paris, 1887, part 1 p. 81 and part 2 pp. 49-53.
18. Tutte, W.T (1948) The dissection of equilateral triangles into equilateral triangles. Proc. Cambridge Philos. Soc. 44 463-482.
19. 7 (in Chinese). J. Xinjiang Univ. Natur. Sci. 6 17-23.