About some cyclic properties in digraphs

DOI10.1016/0095-8956(85)90071-1zbMath0565.05031OpenAlexW1999420866MaRDI QIDQ1058520

Dominique Sotteau, Marie-Claude Heydemann

Publication date: 1985

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

Full work available at URL: https://doi.org/10.1016/0095-8956(85)90071-1

zbMATH Keywords

common cycleshalf degrees

Mathematics Subject Classification ID

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

Related Items (3)

A minimum degree condition forcing a digraph to be k-linked ⋮ \(k\)-linked and \(k\)-cyclic digraphs ⋮ Linkedness and Ordered Cycles in Digraphs

Cites Work

• Unnamed Item
• Unnamed Item
• 2-linked graphs
• Hamiltonian paths in oriented graphs
• On maximal circuits in directed graphs
• A short proof of Meyniel's theorem
• Chemins Et Circuits Dans Les Graphes Orientes
• Cycles in digraphs– a survey
• Sufficient Conditions for Circuits in Graphs^†

This page was built for publication: About some cyclic properties in digraphs