Counting the Eulerian orientations of one class of circulant graphs

MaRDI QIDQ3537203zbMATH OpenFDO

Authors Yuanping Zhang, Xiaoling Shen

Publication date 24 November 2008

zbMATH Keywords

\#P-complete problemcirculant graphsnumber of Eulerian orientations

Mathematics Subject Classification ID

Enumeration in graph theory (05C30)

Recommendations

• On the number of Eulerian orientations of a graph
• scientific article; zbMATH DE number 742958
• Counting planar Eulerian orientations
• Eulerian Orientations and Circulations
• Graph-Theoretic Concepts in Computer Science

Cited in

(8)

• FPT algorithms exploiting carving decomposition for Eulerian orientations and ice-type models
• Covering and Euler cycles on non-oriented graphs
• Counting planar Eulerian orientations
• On the number of Eulerian orientations of a graph
• Asymptotic behavior of the number of Eulerian orientations of graphs
• Eulerian Orientations and Circulations
• Enumeration of Golomb rulers and acyclic orientations of mixed graphs
• Small length circuits in Eulerian orientations of graphs

This page was built for publication: Counting the Eulerian orientations of one class of circulant graphs

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