Exact counting of Euler tours for generalized series-parallel graphs

DOI10.1016/j.jda.2011.03.011zbMath1241.05048arXiv1005.3477OpenAlexW1984327409MaRDI QIDQ414430

Russell Martin, Prasad Chebolu, Mary Cryan

Publication date: 11 May 2012

Published in: Journal of Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1005.3477

zbMATH Keywords

series-parallel graphEuler tour

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Graph algorithms (graph-theoretic aspects) (05C85) Eulerian and Hamiltonian graphs (05C45)

Related Items (2)

Bounded Treewidth and Space-Efficient Linear Algebra ⋮ Cross-series-parallel digraphs

Cites Work

• Unnamed Item
• Evaluating a weighted graph polynomial for graphs of bounded tree-width
• Parallel recognition of series-parallel graphs
• Combinatorial algorithms on a class of graphs
• Forbidden subgraphs and graph decomposition
• The Recognition of Series Parallel Digraphs
• Asymptotic Enumeration of Eulerian Circuits in the Complete Graph
• Random sampling of Euler tours

This page was built for publication: Exact counting of Euler tours for generalized series-parallel graphs