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

DOI10.1016/0012-365X(94)00333-EMaRDI QIDQ1918565zbMATH OpenWikidataFDO

Authors Nicolas Macris, Joe V. Pulé

Publication date 18 July 1996

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0012-365X(94)00333-E

zbMATH Keywords

digraphsEuler trails

Mathematics Subject Classification ID

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

Review text

The number of Euler trails for a very special class of digraphs (in which all in- and out-degrees are equal to two) is expressed in the form of a determinant.

Recommendations

• On a formula for the number of Euler trails for a class of digraphs
• scientific article; zbMATH DE number 1491626
• On the number of Euler trails in directed graphs
• scientific article; zbMATH DE number 3851137
• scientific article; zbMATH DE number 91021
• Asymptotic enumeration theorems for the numbers of spanning trees and Eulerian trails in circulant digraphs and graphs
• scientific article; zbMATH DE number 4162907
• scientific article; zbMATH DE number 3946164
• scientific article; zbMATH DE number 5831723
• The Euler formula of cyclomatic numbers of hypergraphs

Cites work

• Density of states of random Schrödinger operators with a uniform magnetic field
• scientific article; zbMATH DE number 3220706 (Why is no real title available?)
• scientific article; zbMATH DE number 3068971 (Why is no real title available?)

Cited in

(12)

• On a formula for the number of Euler trails for a class of digraphs
• Binary nullity, Euler circuits and interlace polynomials
• A characterization of circle graphs in terms of multimatroid representations
• The number of quasi-trees in fans and wheels
• scientific article; zbMATH DE number 4162907 (Why is no real title available?)
• On the number of Euler trails in directed graphs
• scientific article; zbMATH DE number 1491626 (Why is no real title available?)
• scientific article; zbMATH DE number 1522568 (Why is no real title available?)
• The transition matroid of a 4-regular graph: an introduction
• On the linear algebra of local complementation
• Circuit partitions and signed interlacement in 4-regular graphs
• The critical group of a combinatorial map

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

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