Degrees and cycles in digraphs

DOI10.1016/0012-365X(82)90020-6zbMath0488.05040OpenAlexW1969664239MaRDI QIDQ1165865

Marie-Claude Heydemann

Publication date: 1982

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

Full work available at URL: https://doi.org/10.1016/0012-365x(82)90020-6

zbMATH Keywords

cycledegree sumoriented graphsstrong digraph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Directed graphs (digraphs), tournaments (05C20)

Related Items (2)

On degree sum conditions for directed path-factors with a specified number of paths ⋮ Number of arcs and cycles in digraphs

Cites Work

• Unnamed Item
• Unnamed Item
• On cycles and paths in digraphs
• Longest paths in digraphs
• Sur les arborescences dans un graphe oriente
• Une condition suffisante d'existence d'un circuit Hamiltonien dans un graphe oriente
• Chemins Et Circuits Dans Les Graphes Orientes
• Cycles in digraphs– a survey

This page was built for publication: Degrees and cycles in digraphs