On cycles and paths in digraphs
From MaRDI portal
Publication:1143411
DOI10.1016/0012-365X(80)90039-4zbMath0442.05040MaRDI QIDQ1143411
Publication date: 1980
Published in: Discrete Mathematics (Search for Journal in Brave)
Related Items (5)
A sufficient condition for oriented graphs to be Hamiltonian ⋮ Extremal digraphs avoiding distinct walks of length 3 with the same endpoints ⋮ Cycles in strong oriented graphs ⋮ Longest paths in digraphs ⋮ Degrees and cycles in digraphs
Cites Work
This page was built for publication: On cycles and paths in digraphs