The Complexity of Counting Eulerian Tours in 4-regular Graphs

Qi Ge, Daniel Stefankovic. The Complexity of Counting Eulerian Tours in 4-regular Graphs. Algorithmica, 63(3):588-601, 2012. [doi]

Authors

Qi Ge

This author has not been identified. Look up 'Qi Ge' in Google

Daniel Stefankovic

This author has not been identified. Look up 'Daniel Stefankovic' in Google