Qi Ge, Daniel Stefankovic. The Complexity of Counting Eulerian Tours in 4-Regular Graphs. In Alejandro López-Ortiz, editor, LATIN 2010: Theoretical Informatics, 9th Latin American Symposium, Oaxaca, Mexico, April 19-23, 2010. Proceedings. Volume 6034 of Lecture Notes in Computer Science, pages 638-649, Springer, 2010. [doi]
Abstract is missing.