A short proof of the Chen-Manalastas theorem
From MaRDI portal
Publication:1903737
DOI10.1016/0012-365X(94)00173-1zbMath0839.05078OpenAlexW2030550589MaRDI QIDQ1903737
Publication date: 18 June 1996
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0012-365x(94)00173-1
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Directed graphs (digraphs), tournaments (05C20)
Related Items (7)
Advances in Aharoni-Hartman-Hoffman's conjecture for split digraphs ⋮ Every strong digraph has a spanning strong subgraph with at most \(n+2\alpha-2\) arcs ⋮ Berge's conjecture on directed path partitions -- a survey ⋮ Paths partition with prescribed beginnings in digraphs: A Chvátal-Erdős condition approach ⋮ Spannning a strong digraph by \(\alpha\) circuits: a proof of Gallai's conjecture ⋮ Stable set meeting every longest path ⋮ Covering a strong digraph by \(\alpha-1\) disjoint paths: A proof of Las Vergnas' conjecture
Cites Work
This page was built for publication: A short proof of the Chen-Manalastas theorem