On the girth of digraphs
From MaRDI portal
Publication:1969785
DOI10.1016/S0012-365X(99)00323-4zbMath0945.05030OpenAlexW2044878800MaRDI QIDQ1969785
Publication date: 8 October 2000
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0012-365x(99)00323-4
Extremal problems in graph theory (05C35) Paths and cycles (05C38) Distance in graphs (05C12) Directed graphs (digraphs), tournaments (05C20)
Related Items (12)
Total domination and the Caccetta-Häggkvist conjecture ⋮ Rainbow cycles for families of matchings ⋮ Nonuniform Degrees and Rainbow Versions of the Caccetta–Häggkvist Conjecture ⋮ On the parameterized complexity of 2-partitions ⋮ Short directed cycles in bipartite digraphs ⋮ On the Caccetta-Häggkvist conjecture with a forbidden transitive tournament ⋮ Cycles of given length in oriented graphs ⋮ On diregular digraphs with degree two and excess three ⋮ Oriented bipartite graphs and the Goldbach graph ⋮ Unnamed Item ⋮ Short cycles in oriented graphs ⋮ On the Caccetta-Häggkvist Conjecture with Forbidden Subgraphs
This page was built for publication: On the girth of digraphs
