Short cycles in directed graphs

DOI10.1016/0095-8956(83)90059-XzbMATH Open0545.05038MaRDI QIDQ797594FDOQ797594

Authors: Vašek Chvátal, Endre Szemerédi 

Publication date: 1983

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

zbMATH Keywords

directed cyclecycle lengthminimum outdegree

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• A note on the girth of digraphs

Cited In (18)

• A note on short cycles in digraphs
• Simulating laser-fluid coupling and laser-induced cavitation using embedded boundary and level set methods
• Nonuniform Degrees and Rainbow Versions of the Caccetta–Häggkvist Conjecture
• Further approximations for Aharoni's rainbow generalization of the Caccetta-Häggkvist conjecture
• Short cycles in digraphs
• On the Caccetta-Häggkvist conjecture with forbidden subgraphs
• On the Caccetta-Häggkvist conjecture with a forbidden transitive tournament
• Cycles of given length in oriented graphs
• Minimum order of loop networks of given degree and girth
• On the co-degree threshold for the Fano plane
• Rainbow cycles for families of matchings
• Degree conditions forcing oriented cycles
• Counting subgraphs: A new approach to the Caccetta-Häggkvist conjecture
• Short rainbow cycles for families of matchings and triangles
• On the length of directed paths in digraphs
• Short cycles in oriented graphs
• Some approaches to a conjecture on short cycles in digraphs
• Total domination and the Caccetta-Häggkvist conjecture

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

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