The Complexity of Counting Eulerian Tours in 4-regular Graphs

Published 2010 View Full Article

  1. Home
  2. Publications
  3. Publication Search
  4. Publication Details
Title
The Complexity of Counting Eulerian Tours in 4-regular Graphs
Authors
Keywords
-
Journal
ALGORITHMICA
Volume 63, Issue 3, Pages 588-601
Publisher
Springer Nature
Online
2010-10-21
DOI
10.1007/s00453-010-9463-4

Ask authors/readers for more resources

Protocol

Community support

Reagent

Community support

Reprint

Contact the author

Find Funding. Review Successful Grants.

Explore over 25,000 new funding opportunities and over 6,000,000 successful grants.

Explore

Become a Peeref-certified reviewer

The Peeref Institute provides free reviewer training that teaches the core competencies of the academic peer review process.

Get Started
Webinars Posters Questions Hubs Funding Journals Articles Connect Collections Reviewers About Us FAQs Mobile App Privacy Policy Terms of Use
© Peeref 2019-2024. All rights reserved.