Pages that link to "Item:Q4415581"
From MaRDI portal
The following pages link to On the number of Euler trails in directed graphs (Q4415581):
Displaying 14 items.
- The number of Euler tours of random directed graphs (Q396813) (← links)
- Parity in knot theory and graph-links (Q459460) (← links)
- The transition matroid of a 4-regular graph: an introduction (Q491757) (← links)
- On the linear algebra of local complementation (Q665929) (← links)
- A proof of some Schützenberger-type results for Eulerian paths and circuits on digraphs (Q1335502) (← links)
- On a formula for the number of Euler trails for a class of digraphs (Q1356564) (← links)
- Algorithms and outerplanar conditions for \(A\)-trails in plane Eulerian graphs (Q1392551) (← links)
- Dyck-Eulerian digraphs (Q1792107) (← links)
- An alternative formula for the number of Euler trails for a class of digraphs (Q1918565) (← links)
- Binary nullity, Euler circuits and interlace polynomials (Q2275481) (← links)
- A characterization of circle graphs in terms of multimatroid representations (Q2290352) (← links)
- On the number of \(OE\)-trails for a fixed transition system (Q2810066) (← links)
- (Q3062365) (← links)
- (Q3691783) (← links)