Refined bounds on the number of Eulerian tours in undirected graphs

DOI10.1007/s00453-023-01162-8MaRDI QIDQ6185942

Giulia Punzi, Roberto Grossi, Alessio Conte, Romeo Rizzi

Publication date: 9 January 2024

Published in: Algorithmica (Search for Journal in Brave)

zbMATH Keywords

graph theoryEuler toursgraph enumerationcombinatorial bounds

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Graph theory (05Cxx)

Cites Work

• Unnamed Item
• Bounds on the number of Eulerian orientations
• On non-intersecting Eulerian circuits
• An upper bound for the number of Eulerian orientations of a regular graph
• On the number of Eulerian orientations of a graph
• Beyond the BEST theorem: fast assessment of Eulerian trails
• The complexity of counting Eulerian tours in 4-regular graphs
• Le Polynôme De Martin D'un Graphe Eulerien
• An Eulerian path approach to DNA fragment assembly
• Reverse-Safe Data Structures for Text Indexing
• (Some of) the many uses of Eulerian graphs in graph theory (plus some applications)
• Bounding the number of Eulerian tours in undirected graphs

This page was built for publication: Refined bounds on the number of Eulerian tours in undirected graphs