On a formula for the number of Euler trails for a class of digraphs

DOI10.1016/0012-365X(95)00345-WzbMath0870.05049MaRDI QIDQ1356564

O. Diekmann

Publication date: 15 September 1997

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

digraphintersection matrixnumber of Euler trails

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Directed graphs (digraphs), tournaments (05C20)

Related Items (5)

The number of quasi-trees in fans and wheels ⋮ On the linear algebra of local complementation ⋮ The transition matroid of a 4-regular graph: an introduction ⋮ Binary nullity, Euler circuits and interlace polynomials ⋮ A characterization of circle graphs in terms of multimatroid representations

Cites Work

• Cycle decomposition by disjoint transpositions
• Cycle decomposition by transpositions
• An alternative formula for the number of Euler trails for a class of digraphs

This page was built for publication: On a formula for the number of Euler trails for a class of digraphs