An alternative formula for the number of Euler trails for a class of digraphs

DOI10.1016/0012-365X(94)00333-EzbMath0862.05079WikidataQ127121021 ScholiaQ127121021MaRDI QIDQ1918565

Nicolas Macris, Joseph V. Pulé

Publication date: 18 July 1996

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

zbMATH Keywords

digraphsEuler trails

Mathematics Subject Classification ID

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

Related Items (6)

On a formula for the number of Euler trails for a class of digraphs ⋮ 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

• Density of states of random Schrödinger operators with a uniform magnetic field
• Unnamed Item
• Unnamed Item

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