Extending Greene's theorem to directed graphs

DOI10.1016/0097-3165(83)90046-8zbMath0509.05041OpenAlexW2064001513MaRDI QIDQ1838495

Alan J. Hoffman

Publication date: 1983

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(83)90046-8

zbMATH Keywords

chromatic numberacyclic digraphdecompositions of a partially ordered set into antichainsnumber of pairwise disjoint paths

Mathematics Subject Classification ID

Partial orders, general (06A06) Coloring of graphs and hypergraphs (05C15) Directed graphs (digraphs), tournaments (05C20)

Related Items (7)

On k-optimum dipath partitions and partial k-colourings of acyclic digraphs ⋮ Motivations and history of some of my conjectures ⋮ On greene's theorem for digraphs ⋮ Berge's conjecture on directed path partitions -- a survey ⋮ On covering vertices of a graph by trees ⋮ On Greene-Kleitman's theorem for general digraphs ⋮ Some sequences associated with combinatorial structures

Cites Work

• Unnamed Item
• Unnamed Item
• Extending the Greene-Kleitman theorem to directed graphs
• Some partitions associated with a partially ordered set
• On partitions of a partially ordered set
• A generalization of max flow—min cut
• The structure of Sperner k-families

This page was built for publication: Extending Greene's theorem to directed graphs