Cycles in strong oriented graphs

DOI10.1016/0012-365X(82)90287-4zbMath0472.05028MaRDI QIDQ1158163

Marie-Claude Heydemann

Publication date: 1982

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

cycles

Mathematics Subject Classification ID

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

Related Items (4)

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

Cites Work

• Unnamed Item
• On cycles and paths in digraphs
• On maximal circuits in directed graphs
• On pancyclic digraphs
• Chemins Et Circuits Dans Les Graphes Orientes
• Cycles in digraphs– a survey
• Girth in digraphs

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