Minimum decomposition of partially ordered sets into chains (Q4051928): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A decomposition theorem for partially ordered sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum internally stable sets of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5538300 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Dual of Dilworth's Decomposition Theorem / rank
 
Normal rank

Latest revision as of 16:07, 12 June 2024

scientific article
Language Label Description Also known as
English
Minimum decomposition of partially ordered sets into chains
scientific article

    Statements

    Minimum decomposition of partially ordered sets into chains (English)
    0 references
    0 references
    1975
    0 references
    0 references
    0 references
    0 references
    0 references