The following pages link to On the complexity of posets (Q1235192):
Displaying 22 items.
- On incomplete preference structures (Q585061) (← links)
- Dimensions of hypergraphs (Q757427) (← links)
- Angle orders (Q762509) (← links)
- The relationship between the threshold dimension of split graphs and various dimensional parameters (Q803177) (← links)
- Interval dimension is a comparability invariant (Q804609) (← links)
- Adjacency posets of planar graphs (Q966048) (← links)
- On realizable biorders and the biorder dimension of a relation (Q1057213) (← links)
- The dimension of the Cartesian product of partial orders (Q1061151) (← links)
- On the separation of two relations by a biorder or a semiorder (Q1087450) (← links)
- A construction for partially ordered sets (Q1145708) (← links)
- Stacks and splits of partially ordered sets (Q1160199) (← links)
- The dimension of planar posets (Q1217722) (← links)
- Maximal dimensional partially ordered sets. III: A characterization of Hiraguchi's inequality for interval dimension (Q1229735) (← links)
- Characterization problems for graphs, partially ordered sets, lattices, and families of sets (Q1237785) (← links)
- Split semiorders (Q1296976) (← links)
- Algorithms constructing a representive vector criterion for a binary preference relation (Q1343006) (← links)
- Generalizations of semiorders: A review note (Q1384555) (← links)
- A recognition algorithm for orders of interval dimension two (Q1894368) (← links)
- A min-max property of chordal bipartite graphs with applications (Q1959718) (← links)
- The Complexity of the Partial Order Dimension Problem (Q3663349) (← links)
- Maximum Semiorders in Interval Orders (Q3963053) (← links)
- Dimension and matchings in comparability and incomparability graphs. (Q5965146) (← links)
