Computing and Bounding the Number of Eulerian Orientations for Certain Classes of $4$-Regular Graphs
The bounds on the number of Eulerian orientations for certain classes of connected, loopless $4-regular graphs are improved and a divide-and-conquer algorithm is provided that leverages structural properties to compute the exact number of Eulerian orientations for separable graphs without exhaustive enumeration.
Evangelos Bartzos, Michalis Samaris
· 0 citations