Exact counting of Euler Tours for Graphs of Bounded Treewidth

P. Chebolu, M. Cryan, R. Martin

Research output: Working paper

Abstract / Description of output

In this paper we give a simple polynomial-time algorithm to exactly count the number of Euler Tours (ETs) of any Eulerian graph of bounded treewidth. The problems of counting ETs are known to be #P-complete for general graphs (Brightwell and Winkler, (Brightwell and Winkler, 2005). To date, no polynomial-time algorithm for counting Euler tours of any class of graphs is known except for the very special case of series-parallel graphs (which have treewidth 2).
Original languageEnglish
Number of pages16
Publication statusPublished - 1 Oct 2013

Keywords / Materials (for Non-textual outputs)

  • Computer Science - Discrete Mathematics, Mathematics - Combinatorics, 05C85, 68R10


Dive into the research topics of 'Exact counting of Euler Tours for Graphs of Bounded Treewidth'. Together they form a unique fingerprint.

Cite this