On the number of Euler trails in directed graphs
From MaRDI portal
Publication:4415581
DOI10.7146/math.scand.a-14370zbMath1017.05067MaRDI QIDQ4415581
Publication date: 6 August 2003
Published in: MATHEMATICA SCANDINAVICA (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.7146/math.scand.a-14370
05C50: Graphs and linear algebra (matrices, eigenvalues, etc.)
05C45: Eulerian and Hamiltonian graphs
Related Items
Parity in knot theory and graph-links, The transition matroid of a 4-regular graph: an introduction, On the linear algebra of local complementation, Binary nullity, Euler circuits and interlace polynomials, A characterization of circle graphs in terms of multimatroid representations