Number of arcs and cycles in digraphs

DOI10.1016/0012-365X(84)90081-5MaRDI QIDQ799688zbMATH OpenFDO

Authors Marie-Claude Heydemann, D. Sotteau

Publication date 1984

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0012-365X(84)90081-5

zbMATH Keywords

cyclesstrong digraphs

Mathematics Subject Classification ID

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

Review text

The authors determine the maximum number of arcs a strong digraph \(D_ n\) can have if it has no cycle of length at least n-k where \(n\geq k^ 2+2k+5\).

Cites work

• Chemins Et Circuits Dans Les Graphes Orientes
• Cycles in digraphs– a survey
• Cycles in strong oriented graphs
• Degrees and cycles in digraphs
• On maximal circuits in directed graphs
• On pancyclic digraphs
• Une condition suffisante d'existence d'un circuit Hamiltonien dans un graphe oriente

Cited in

(4)

• A sufficient condition for oriented graphs to be Hamiltonian
• scientific article; zbMATH DE number 4027500 (Why is no real title available?)
• scientific article; zbMATH DE number 4198025 (Why is no real title available?)
• Almost symmetric cycles in large digraphs

This page was built for publication: Number of arcs and cycles in digraphs

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