On the Existence of D(n,p) in Directed Graphs

DOI10.1016/S0304-0208(08)73371-1zbMATH Open0523.05039OpenAlexW179770773MaRDI QIDQ3674701FDOQ3674701

Adam Paweł Wojda, Abdelhamid Benhocine

Publication date: 1983

Published in: Combinatorial Mathematics, Proceedings of the International Colloquium on Graph Theory and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-0208(08)73371-1

zbMATH Keywords

directed cyclechanging the orientation of consecutive edges

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20)

Cited In (1)

• Covering the vertices of a digraph by cycles of prescribed length

This page was built for publication: On the Existence of D(n,p) in Directed Graphs

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