Asymptotic Enumeration of Eulerian Circuits in the Complete Graph
From MaRDI portal
Publication:4238173
DOI10.1017/S0963548398003642zbMath0916.05048MaRDI QIDQ4238173
Brendan D. McKay, Robert W. Robinson
Publication date: 7 July 1999
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s0963548398003642
05C30: Enumeration in graph theory
05A16: Asymptotic enumeration
05C20: Directed graphs (digraphs), tournaments
05C45: Eulerian and Hamiltonian graphs
Related Items
Semi-restricted rock, paper, scissors, Asymptotic behavior of the number of Eulerian orientations of graphs, The number of Euler tours of random directed graphs, Exact counting of Euler tours for generalized series-parallel graphs, The genus of complete 3-uniform hypergraphs, Asymptotic enumeration of dense 0-1 matrices with specified line sums, Subgraphs of Dense Random Graphs with Specified Degrees, Random dense bipartite graphs and directed graphs with specified degrees