An upper bound for the number of Eulerian orientations of a regular graph

DOI10.1007/BF02122696zbMath0737.05056MaRDI QIDQ1173620

Michel Las Vergnas

Publication date: 25 June 1992

Published in: Combinatorica (Search for Journal in Brave)

zbMATH Keywords

regular graphEulerian orientation

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Directed graphs (digraphs), tournaments (05C20)

Related Items

Asymptotic behavior of the number of Eulerian orientations of graphs ⋮ Bounding the number of Eulerian tours in undirected graphs ⋮ Refined bounds on the number of Eulerian tours in undirected graphs ⋮ Even subgraph expansions for the flow polynomial of planar graphs with maximum degree at most 4 ⋮ Circle graphs and the cycle double cover conjecture ⋮ A short survey on stable polynomials, orientations and matchings

Cites Work

• Bounds on the number of Eulerian orientations
• The asymptotic numbers of regular tournaments, Eulerian digraphs and Eulerian oriented graphs
• Le Polynôme De Martin D'un Graphe Eulerien