Short cycles in directed graphs

DOI10.1016/0095-8956(83)90059-XzbMath0545.05038MaRDI QIDQ797594

Václav Chvátal

Publication date: 1983

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

zbMATH Keywords

cycle lengthdirected cycleminimum outdegree

Mathematics Subject Classification ID

Paths and cycles (05C38) Directed graphs (digraphs), tournaments (05C20)

Related Items (15)

Some approaches to a conjecture on short cycles in digraphs ⋮ Further approximations for Aharoni's rainbow generalization of the Caccetta-Häggkvist conjecture ⋮ Minimum order of loop networks of given degree and girth ⋮ Counting subgraphs: A new approach to the Caccetta-Häggkvist conjecture ⋮ Short cycles in digraphs ⋮ 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 co-degree threshold for the Fano plane ⋮ On the Caccetta-Häggkvist conjecture with a forbidden transitive tournament ⋮ Cycles of given length in oriented graphs ⋮ A note on short cycles in digraphs ⋮ Short cycles in oriented graphs ⋮ On the Caccetta-Häggkvist Conjecture with Forbidden Subgraphs ⋮ Simulating laser-fluid coupling and laser-induced cavitation using embedded boundary and level set methods

Cites Work

• Unnamed Item
• A note on the girth of digraphs

This page was built for publication: Short cycles in directed graphs