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]

Abstract

Abstract is missing.