Minimizing the jump number for partially-ordered sets: A graph-theoretic approach. II (Q1104949): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0012-365x(87)90017-3 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2002972843 / rank | |||
Normal rank | |||
Latest revision as of 10:22, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Minimizing the jump number for partially-ordered sets: A graph-theoretic approach. II |
scientific article |
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
