Bounding the number of Eulerian tours in undirected graphs

DOI10.1007/978-3-031-22105-7_33OpenAlexW4313342917MaRDI QIDQ6113863

Giulia Punzi

Publication date: 10 August 2023

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-031-22105-7_33

zbMATH Keywords

graph theoryEuler toursgraph enumeration

Mathematics Subject Classification ID

Discrete mathematics in relation to computer science (68Rxx)

Related Items

Bounding the number of Eulerian tours in undirected graphs, Refined bounds on the number of Eulerian tours in undirected graphs

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