The following pages link to Partial orders of dimension 2 (Q5659598):
Displaying 50 items.
- A characterization of the \(n\)-agent Pareto dominance relation (Q284382) (← links)
- Ranking chain sum orders (Q290525) (← links)
- Planar posets, dimension, breadth and the number of minimal elements (Q304190) (← links)
- A proof of Frankl's union-closed sets conjecture for dismantlable lattices (Q334974) (← links)
- Bin packing with ``largest in bottom'' constraint: tighter bounds and generalizations (Q385496) (← links)
- Representing graphs via pattern avoiding words (Q491554) (← links)
- Mixed models, random utilities, and the triangle inequality (Q595587) (← links)
- The partial visibility representation extension problem (Q724235) (← links)
- Dimensions of hypergraphs (Q757427) (← links)
- Matching relations and the dimensional structure of social choices (Q760319) (← links)
- On the grading numbers of direct products of chains (Q793064) (← links)
- Drawing orders with few slopes (Q807654) (← links)
- Point algebras for temporal reasoning: Algorithms and complexity (Q814509) (← links)
- Single machine precedence constrained scheduling is a Vertex cover problem (Q1016523) (← links)
- Localized and compact data-structure for comparability graphs (Q1025540) (← links)
- On realizable biorders and the biorder dimension of a relation (Q1057213) (← links)
- Asymptotic enumeration of two-dimensional posets (Q1122599) (← links)
- Generating sets for lattices of dimension two (Q1145163) (← links)
- Restricted thresholds for interval orders: A case of nonaxiomatizability by a universal sentence (Q1163533) (← links)
- Comparability graphs and intersection graphs (Q1172652) (← links)
- Transitive closure for restricted classes of partial orders (Q1182064) (← links)
- Planar lattices are lexicographically shellable (Q1198483) (← links)
- Some new explorations into the mystery of time and band limiting (Q1201934) (← links)
- Certain partially ordered sets of dimension three (Q1218446) (← links)
- Arbres et dimension des ordres (Q1222175) (← links)
- A bound on the dimension of interval orders (Q1235194) (← links)
- Characterization problems for graphs, partially ordered sets, lattices, and families of sets (Q1237785) (← links)
- The dimension of semiorders (Q1246440) (← links)
- A characteristic property of labelings and linear extensions of posets of dimension 2 (Q1276391) (← links)
- Line directionality of orders (Q1311417) (← links)
- Generalizations of semiorders: A review note (Q1384555) (← links)
- The mutual exclusion scheduling problem for permutation and comparability graphs. (Q1401918) (← links)
- On linear and circular structure of (claw, net)-free graphs (Q1406025) (← links)
- Interval-valued rank in finite ordered sets (Q1686200) (← links)
- Boolean dimension and local dimension (Q1690054) (← links)
- The queue-number of posets of bounded width or height (Q1725753) (← links)
- Bipolar orientations revisited (Q1842650) (← links)
- Upward planarity testing (Q1904391) (← links)
- Vertex deletion into bipartite permutation graphs (Q2161007) (← links)
- Revealed preference dimension via matrix sign rank (Q2190381) (← links)
- Applications of Ramsey theory (Q2266026) (← links)
- Ordered sets with interval representation and \((m,n)\)-Ferrers relation (Q2271872) (← links)
- The graph of critical pairs of a crown (Q2279688) (← links)
- Paretian partial orders: the two-agent case (Q2347924) (← links)
- On maximum independent set of categorical product and ultimate categorical ratios of graphs (Q2348262) (← links)
- The dimension of posets with planar cover graphs. (Q2354607) (← links)
- Tree-width and dimension (Q2400108) (← links)
- A graphical calculus for semi-groupal categories (Q2423828) (← links)
- Embedding linear orders in grids (Q2491206) (← links)
- Dimension and height for posets with planar cover graphs. (Q2509772) (← links)
