Covering the vertices of a digraph by cycles of prescribed length
From MaRDI portal
Publication:1174160
DOI10.1016/0012-365X(91)90041-YzbMath0764.05070MaRDI QIDQ1174160
Publication date: 25 June 1992
Published in: Discrete Mathematics (Search for Journal in Brave)
Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Directed graphs (digraphs), tournaments (05C20)
Related Items (4)
On a conjecture on directed cycles in a directed bipartite graph ⋮ Partition of a directed bipartite graph into two directed cycles ⋮ Covering the vertices of a digraph by cycles of prescribed length ⋮ On 1-factors with prescribed lengths in tournaments
Cites Work
- Unnamed Item
- Hamilton connected graphs
- On circuits in graphs
- Covering the vertices of a digraph by cycles of prescribed length
- On Hamilton's ideals
- Covering the vertices of a graph by cycles of prescribed length
- On the Existence of D(n,p) in Directed Graphs
- Orientations of hamiltonian cycles in large digraphs
- Chemins Et Circuits Dans Les Graphes Orientes
- On the maximal number of independent circuits in a graph
This page was built for publication: Covering the vertices of a digraph by cycles of prescribed length
