Degrees and cycles in digraphs

DOI10.1016/0012-365X(82)90020-6zbMATH Open0488.05040OpenAlexW1969664239MaRDI QIDQ1165865FDOQ1165865

Authors: 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

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Sur les arborescences dans un graphe oriente
• Une condition suffisante d'existence d'un circuit Hamiltonien dans un graphe oriente
• Cycles in digraphs– a survey
• Chemins Et Circuits Dans Les Graphes Orientes
• On cycles and paths in digraphs
• Longest paths in digraphs

Cited In (2)

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

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

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