Sur les arborescences dans un graphe oriente

DOI10.1016/0012-365X(76)90107-2zbMath0335.05114MaRDI QIDQ1229222

Michel Las Vergnas

Publication date: 1976

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

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20)

Related Items (9)

The complexity of finding arc-disjoint branching flows ⋮ Structural properties of minimal strong digraphs versus trees ⋮ Minimum Leaf Out-Branching Problems ⋮ Longest paths in digraphs ⋮ Degrees and cycles in digraphs ⋮ Diperfect graphs ⋮ Basic Terminology, Notation and Results ⋮ Covering a strong digraph by \(\alpha-1\) disjoint paths: A proof of Las Vergnas' conjecture ⋮ Balanced branchings in digraphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On Hamilton's ideals
• Large cycles in graphs
• Une condition suffisante d'existence d'un circuit Hamiltonien dans un graphe oriente
• Sufficient Conditions for Circuits in Graphs^†

This page was built for publication: Sur les arborescences dans un graphe oriente