Qi Ge, Daniel Stefankovic. The Complexity of Counting Eulerian Tours in 4-regular Graphs. Algorithmica, 63(3):588-601, 2012. [doi]
@article{GeS12,
title = {The Complexity of Counting Eulerian Tours in 4-regular Graphs},
author = {Qi Ge and Daniel Stefankovic},
year = {2012},
doi = {10.1007/s00453-010-9463-4},
url = {http://dx.doi.org/10.1007/s00453-010-9463-4},
researchr = {https://researchr.org/publication/GeS12},
cites = {0},
citedby = {0},
journal = {Algorithmica},
volume = {63},
number = {3},
pages = {588-601},
}