Minimizing the jump number for partially-ordered sets: A graph-theoretic approach. II (Q1104949)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Minimizing the jump number for partially-ordered sets: A graph-theoretic approach. II |
scientific article; zbMATH DE number 4057574
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Minimizing the jump number for partially-ordered sets: A graph-theoretic approach. II |
scientific article; zbMATH DE number 4057574 |
Statements
Minimizing the jump number for partially-ordered sets: A graph-theoretic approach. II (English)
0 references
1987
0 references
arc diagrams of posets
0 references
jump number problem
0 references
N-free posets
0 references
greedy chains
0 references
0 references