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

Qi Ge, Daniel Stefankovic (2010)

> Home

Details and statistics

DOI: 10.1007/978-3-642-12200-2_55

access: closed

type: Conference or Workshop Paper

metadata version: 2019-10-19

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/latin/GeS10
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/latin/GeS10
Qi Ge, Daniel Stefankovic:
The Complexity of Counting Eulerian Tours in 4-Regular Graphs. LATIN 2010: 638-649

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.