Partial orders of dimension 2
From MaRDI portal
Cites work
- A Characterization of Comparability Graphs and of Interval Graphs
- A NEW CHARACTERIZATION OF PARTIAL ORDERS OF DIMENSION TWO
- scientific article; zbMATH DE number 3339023 (Why is no real title available?)
- scientific article; zbMATH DE number 3340114 (Why is no real title available?)
- scientific article; zbMATH DE number 3417398 (Why is no real title available?)
- Incidence matrices and interval graphs
Cited in
(78)- Single machine precedence constrained scheduling is a Vertex cover problem
- Localized and compact data-structure for comparability graphs
- On realizable biorders and the biorder dimension of a relation
- Asymptotic enumeration of two-dimensional posets
- Generating sets for lattices of dimension two
- Restricted thresholds for interval orders: A case of nonaxiomatizability by a universal sentence
- Comparability graphs and intersection graphs
- Transitive closure for restricted classes of partial orders
- Planar lattices are lexicographically shellable
- Some new explorations into the mystery of time and band limiting
- Certain partially ordered sets of dimension three
- Arbres et dimension des ordres
- A bound on the dimension of interval orders
- Characterization problems for graphs, partially ordered sets, lattices, and families of sets
- The dimension of semiorders
- A characteristic property of labelings and linear extensions of posets of dimension 2
- Line directionality of orders
- Generalizations of semiorders: A review note
- The mutual exclusion scheduling problem for permutation and comparability graphs.
- On linear and circular structure of (claw, net)-free graphs
- Interval-valued rank in finite ordered sets
- Boolean dimension and local dimension
- The queue-number of posets of bounded width or height
- Bipolar orientations revisited
- Upward planarity testing
- Vertex deletion into bipartite permutation graphs
- Revealed preference dimension via matrix sign rank
- Applications of Ramsey theory
- Ordered sets with interval representation and (m,n)-Ferrers relation
- The graph of critical pairs of a crown
- Paretian partial orders: the two-agent case
- On maximum independent set of categorical product and ultimate categorical ratios of graphs
- The dimension of posets with planar cover graphs.
- Tree-width and dimension
- A graphical calculus for semi-groupal categories
- Embedding linear orders in grids
- Dimension and height for posets with planar cover graphs.
- Betweenness, orders and interval graphs
- Maximal dimensional partially ordered sets. II: Characterization of 2n- element posets with dimension n
- Complete edge-colored permutation graphs
- A characterization of the n-agent Pareto dominance relation
- Ranking chain sum orders
- Contact representations of planar graphs: extending a partial representation is hard
- Convex independence in permutation graphs
- Planar posets, dimension, breadth and the number of minimal elements
- A proof of Frankl's union-closed sets conjecture for dismantlable lattices
- Distance Labeling for Permutation Graphs
- Bin packing with ``largest in bottom constraint: tighter bounds and generalizations
- Planar Posets Have Dimension at Most Linear in Their Height
- On the dimension of vertex labeling of k-uniform dcsl of an even cycle
- Some inequalities for orderings of acyclic digraphs
- Linear time algorithms for dominating pairs in asteroidal triple-free graphs
- On Modular Lattices of Order Dimension Two
- Representing graphs via pattern avoiding words
- Computing a dominating pair in an asteroidal triple-free graph in linear time
- scientific article; zbMATH DE number 7122741 (Why is no real title available?)
- The Number of Plane Diagrams of a Lattice
- Equational axioms for classes of lattices
- On the dimension of vertex labeling of k-uniform dcsl of k-uniform caterpillar
- On planarity of join-between lattices
- Confluent Hasse Diagrams
- Mixed models, random utilities, and the triangle inequality
- A characterization of two-agent Pareto representable orderings
- A Sublinear Bound on the Page Number of Upward Planar Graphs
- Vertex deletion into bipartite permutation graphs
- Interval-dismantling for lattices
- A compact data structure and parallel algorithms for permutation graphs
- On the Weisfeiler-Leman dimension of permutation graphs
- Dimension of RC-lattices
- Single-crossing dominance: a preference lattice
- The stochastic 2-binary choice problem
- Combinatorics of rectangulations: old and new bijections
- Optimal distance labeling for permutation graphs
- Dimensions of hypergraphs
- Matching relations and the dimensional structure of social choices
- On the grading numbers of direct products of chains
- Drawing orders with few slopes
- Point algebras for temporal reasoning: Algorithms and complexity
This page was built for publication: Partial orders of dimension 2
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5659598)
