Extending Greene's theorem to directed graphs (Q1838495): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0097-3165(83)90046-8 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2064001513 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5545303 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some partitions associated with a partially ordered set / rank
 
Normal rank
Property / cites work
 
Property / cites work: The structure of Sperner k-families / rank
 
Normal rank
Property / cites work
 
Property / cites work: A generalization of max flow—min cut / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3236252 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On partitions of a partially ordered set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extending the Greene-Kleitman theorem to directed graphs / rank
 
Normal rank

Latest revision as of 17:31, 13 June 2024

scientific article
Language Label Description Also known as
English
Extending Greene's theorem to directed graphs
scientific article

    Statements

    Extending Greene's theorem to directed graphs (English)
    0 references
    1983
    0 references
    decompositions of a partially ordered set into antichains
    0 references
    acyclic digraph
    0 references
    chromatic number
    0 references
    number of pairwise disjoint paths
    0 references
    0 references

    Identifiers