Partial orders of dimension 2

Related Items

A characterization of the $n$-agent Pareto dominance relation, Ranking chain sum orders, Planar posets, dimension, breadth and the number of minimal elements, Computing a dominating pair in an asteroidal triple-free graph in linear time, A proof of Frankl's union-closed sets conjecture for dismantlable lattices, Upward planarity testing, Vertex deletion into bipartite permutation graphs, Equational axioms for classes of lattices, Tree-width and dimension, Mixed models, random utilities, and the triangle inequality, Asymptotic enumeration of two-dimensional posets, Unnamed Item, Generalizations of semiorders: A review note, Bin packing with ``largest in bottom constraint: tighter bounds and generalizations, Contact Representations of Planar Graphs: Extending a Partial Representation is Hard, Complete edge-colored permutation graphs, Interval-valued rank in finite ordered sets, A characterization of two-agent Pareto representable orderings, Unnamed Item, A Sublinear Bound on the Page Number of Upward Planar Graphs, Revealed preference dimension via matrix sign rank, Boolean dimension and local dimension, A graphical calculus for semi-groupal categories, Interval-dismantling for lattices, A compact data structure and parallel algorithms for permutation graphs, Convex Independence in Permutation Graphs, Generating sets for lattices of dimension two, The mutual exclusion scheduling problem for permutation and comparability graphs., On Modular Lattices of Order Dimension Two, Planar Posets Have Dimension at Most Linear in Their Height, On linear and circular structure of (claw, net)-free graphs, Restricted thresholds for interval orders: A case of nonaxiomatizability by a universal sentence, Comparability graphs and intersection graphs, The queue-number of posets of bounded width or height, On the dimension of vertex labeling of k-uniform dcsl of an even cycle, Transitive closure for restricted classes of partial orders, Representing graphs via pattern avoiding words, Linear time algorithms for dominating pairs in asteroidal triple-free graphs, Planar lattices are lexicographically shellable, Some new explorations into the mystery of time and band limiting, On the dimension of vertex labeling of $k$-uniform dcsl of $k$-uniform caterpillar, Embedding linear orders in grids, Certain partially ordered sets of dimension three, Applications of Ramsey theory, Arbres et dimension des ordres, Vertex deletion into bipartite permutation graphs, Ordered sets with interval representation and $(m,n)$-Ferrers relation, A bound on the dimension of interval orders, Characterization problems for graphs, partially ordered sets, lattices, and families of sets, The graph of critical pairs of a crown, The Number of Plane Diagrams of a Lattice, The partial visibility representation extension problem, Dimension and height for posets with planar cover graphs., The dimension of semiorders, Confluent Hasse Diagrams, Single machine precedence constrained scheduling is a Vertex cover problem, Dimensions of hypergraphs, Localized and compact data-structure for comparability graphs, Matching relations and the dimensional structure of social choices, A characteristic property of labelings and linear extensions of posets of dimension 2, Betweenness, orders and interval graphs, Maximal dimensional partially ordered sets. II: Characterization of 2n- element posets with dimension n, Bipolar orientations revisited, On the grading numbers of direct products of chains, On realizable biorders and the biorder dimension of a relation, Unnamed Item, Line directionality of orders, Distance Labeling for Permutation Graphs, Paretian partial orders: the two-agent case, On maximum independent set of categorical product and ultimate categorical ratios of graphs, Drawing orders with few slopes, The dimension of posets with planar cover graphs., Point algebras for temporal reasoning: Algorithms and complexity

Cites Work