Cycles in strong oriented graphs

DOI10.1016/0012-365X(82)90287-4MaRDI QIDQ1158163zbMATH OpenFDO

Authors Marie-Claude Heydemann

Publication date 1982

Published in Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

cycles

Mathematics Subject Classification ID

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

Cites work

• scientific article; zbMATH DE number 3758364 (Why is no real title available?)
• Chemins Et Circuits Dans Les Graphes Orientes
• Cycles in digraphs– a survey
• Girth in digraphs
• On cycles and paths in digraphs
• On maximal circuits in directed graphs
• On pancyclic digraphs

Cited in

(4)

• On graphs of defect at most 2
• On bipartite graphs of defect at most 4
• Number of arcs and cycles in digraphs
• A sufficient condition for oriented graphs to be Hamiltonian

This page was built for publication: Cycles in strong oriented graphs

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