Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.
Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.
Qi Ge, Daniel Stefankovic. The Complexity of Counting Eulerian Tours in 4-regular Graphs. Algorithmica, 63(3):588-601, 2012. [doi]
No references recorded for this publication.
No citations of this publication recorded.