Minimizing Setups for Cycle-Free Ordered Sets (Q3960747): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
label / enlabel / en
 
Minimizing Setups for Cycle-Free Ordered Sets
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.2307/2044053 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4243116328 / rank
 
Normal rank
Property / title
 
Minimizing Setups for Cycle-Free Ordered Sets (English)
Property / title: Minimizing Setups for Cycle-Free Ordered Sets (English) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4068748 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5646916 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Jump Number of Dags and Posets: An Introduction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4200070 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A decomposition theorem for partially ordered sets / rank
 
Normal rank

Latest revision as of 16:10, 13 June 2024

scientific article
Language Label Description Also known as
English
Minimizing Setups for Cycle-Free Ordered Sets
scientific article

    Statements

    0 references
    0 references
    0 references
    1982
    0 references
    linear extensions of ordered sets
    0 references
    minimizing setups
    0 references
    alternating cycles
    0 references
    Minimizing Setups for Cycle-Free Ordered Sets (English)
    0 references

    Identifiers