Refined bounds on the number of Eulerian tours in undirected graphs

DOI10.1007/S00453-023-01162-8MaRDI QIDQ6185942zbMATH OpenFDO

Authors Giulia Punzi, Alessio Conte, Roberto Grossi, Romeo Rizzi

Publication date 9 January 2024

Published in Algorithmica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S00453-023-01162-8

zbMATH Keywords

combinatorial boundsEuler toursgraph enumerationgraph theory

Mathematics Subject Classification ID

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

Cites work

• (Some of) the many uses of Eulerian graphs in graph theory (plus some applications)
• An Eulerian path approach to DNA fragment assembly
• An upper bound for the number of Eulerian orientations of a regular graph
• Beyond the BEST theorem: fast assessment of Eulerian trails
• Bounding the number of Eulerian tours in undirected graphs
• Bounds on the number of Eulerian orientations
• scientific article; zbMATH DE number 3068971 (Why is no real title available?)
• Le Polynôme De Martin D'un Graphe Eulerien
• On non-intersecting Eulerian circuits
• On the number of Eulerian orientations of a graph
• Reverse-safe data structures for text indexing

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6185942)