Qi Ge Daniel Stefankovic The Complexity of Counting Eulerian Tours in 4-Regular Graphs. 638-649 2010 LATIN http://dx.doi.org/10.1007/978-3-642-12200-2_55 conf/latin/2010 db/conf/latin/latin2010.html#GeS10