Extending the Greene-Kleitman theorem to directed graphs
From MaRDI portal
Publication:1155625
DOI10.1016/0097-3165(81)90029-7zbMath0467.05029OpenAlexW1969719366MaRDI QIDQ1155625
Publication date: 1981
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0097-3165(81)90029-7
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Directed graphs (digraphs), tournaments (05C20)
Related Items
On k-optimum dipath partitions and partial k-colourings of acyclic digraphs ⋮ Linial's conjecture for arc-spine digraphs ⋮ Proof of Berge's path partition conjecture for \(k \geq \lambda - 3\) ⋮ Motivations and history of some of my conjectures ⋮ On greene's theorem for digraphs ⋮ Advances in Aharoni-Hartman-Hoffman's conjecture for split digraphs ⋮ Minmax relations for cyclically ordered digraphs ⋮ Berge's conjecture on directed path partitions -- a survey ⋮ k-optimal partitions of a directed graph ⋮ Proof of Berge's strong path partition conjecture for \(k=2\) ⋮ On Linial's conjecture for spine digraphs ⋮ A unified approach to known and unknown cases of Berge's conjecture ⋮ On the strong path partition conjecture of Berge ⋮ On Greene-Kleitman's theorem for general digraphs ⋮ Berge's conjecture and Aharoni-Hartman-Hoffman's conjecture for locally in-semicomplete digraphs ⋮ On the Berge's strong path partition conjecture ⋮ Finite posets and Ferrers shapes ⋮ On Path Partitions and Colourings in Digraphs ⋮ Path Partitions, Cycle Covers and Integer Decomposition ⋮ Extending Greene's theorem to directed graphs ⋮ Acyclic digraphs with Gallai-Milgram-Linial property for clique-covers ⋮ Some sequences associated with combinatorial structures
Cites Work
This page was built for publication: Extending the Greene-Kleitman theorem to directed graphs
