-
1
A proof of some Schützenberger-type results for Eulerian paths and circuits on digraphs
Published 1994-01-01Subjects: “…digraph…”
Get full text
Article -
2
Existence of acyclic matching and Morse complex on transitive digraphs
Published 2025-01-01Subjects: “…Transitive digraphs…”
Get full text
Article -
3
Notes on sufficient conditions for a graph to be Hamiltonian
Published 1991-01-01Subjects: Get full text
Article