Counting the Number of Euler Circuits in Complete Graphs
John Matthew Dwyer · 2008
In graph theory, a long standing problem has involved finding a closed form expression for the number of Euler circuits in Kn. This solution presented here comprises a function D(x,y) that has several interesting applications in computer science.