Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

"The Complexity of Counting Eulerian Tours in 4-regular Graphs."

Qi Ge, Daniel Stefankovic (2012)

> Home

Details and statistics

DOI: 10.1007/S00453-010-9463-4

access: closed

type: Journal Article

metadata version: 2019-10-19

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/algorithmica/GeS12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/algorithmica/GeS12
Qi Ge, Daniel Stefankovic:
The Complexity of Counting Eulerian Tours in 4-regular Graphs. Algorithmica 63(3): 588-601 (2012)

a service of

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.