About some cyclic properties in digraphs

DOI10.1016/0095-8956(85)90071-1MaRDI QIDQ1058520zbMATH OpenOpenAlexFDO

Authors Marie-Claude Heydemann, D. Sotteau

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

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

Review text

See the preview in Zbl 0549.05031.

Cites work

• 2-linked graphs
• A short proof of Meyniel's theorem
• Chemins Et Circuits Dans Les Graphes Orientes
• Cycles in digraphs– a survey
• Hamiltonian paths in oriented graphs
• scientific article; zbMATH DE number 3758364 (Why is no real title available?)
• scientific article; zbMATH DE number 3893232 (Why is no real title available?)
• On maximal circuits in directed graphs
• Sufficient Conditions for Circuits in Graphs^†

Cited in

(10)

• An interesting property of a class of circulant graphs
• scientific article; zbMATH DE number 5840392 (Why is no real title available?)
• Properties of digraphs connected with some congruence relations
• scientific article; zbMATH DE number 3875315 (Why is no real title available?)
• A minimum degree condition forcing a digraph to be k-linked
• Linkedness and Ordered Cycles in Digraphs
• On digraphs with the odd cycle property
• On properties of primitive sets of digraphs with common cycles
• scientific article; zbMATH DE number 3319308 (Why is no real title available?)
• k-linked and k-cyclic digraphs

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

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