Partial orders of dimension 2
From MaRDI portal
Publication:5659598
DOI10.1002/NET.3230020103zbMATH Open0247.06002OpenAlexW2154635726WikidataQ56227815 ScholiaQ56227815MaRDI QIDQ5659598FDOQ5659598
Authors: Kirby A. Baker, Fred Roberts, Peter Fishburn 
Publication date: 1972
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.3230020103
Cites Work
Cited In (73)
- Localized and compact data-structure for comparability graphs
- On maximum independent set of categorical product and ultimate categorical ratios of graphs
- The queue-number of posets of bounded width or height
- On Modular Lattices of Order Dimension Two
- Linear time algorithms for dominating pairs in asteroidal triple-free graphs
- Applications of Ramsey theory
- A characteristic property of labelings and linear extensions of posets of dimension 2
- A characterization of the \(n\)-agent Pareto dominance relation
- Comparability graphs and intersection graphs
- Generalizations of semiorders: A review note
- Contact representations of planar graphs: extending a partial representation is hard
- Ranking chain sum orders
- Mixed models, random utilities, and the triangle inequality
- Embedding linear orders in grids
- Equational axioms for classes of lattices
- Planar posets, dimension, breadth and the number of minimal elements
- On linear and circular structure of (claw, net)-free graphs
- Characterization problems for graphs, partially ordered sets, lattices, and families of sets
- Dimensions of hypergraphs
- Generating sets for lattices of dimension two
- Certain partially ordered sets of dimension three
- Line directionality of orders
- Transitive closure for restricted classes of partial orders
- Asymptotic enumeration of two-dimensional posets
- Planar Posets Have Dimension at Most Linear in Their Height
- Interval-dismantling for lattices
- A bound on the dimension of interval orders
- Betweenness, orders and interval graphs
- On realizable biorders and the biorder dimension of a relation
- Title not available (Why is that?)
- Vertex deletion into bipartite permutation graphs
- Some new explorations into the mystery of time and band limiting
- Upward planarity testing
- The mutual exclusion scheduling problem for permutation and comparability graphs.
- A proof of Frankl's union-closed sets conjecture for dismantlable lattices
- Distance Labeling for Permutation Graphs
- The dimension of semiorders
- Paretian partial orders: the two-agent case
- Matching relations and the dimensional structure of social choices
- Single machine precedence constrained scheduling is a Vertex cover problem
- Representing graphs via pattern avoiding words
- Interval-valued rank in finite ordered sets
- Planar lattices are lexicographically shellable
- The dimension of posets with planar cover graphs.
- Tree-width and dimension
- Restricted thresholds for interval orders: A case of nonaxiomatizability by a universal sentence
- Point algebras for temporal reasoning: Algorithms and complexity
- Revealed preference dimension via matrix sign rank
- On the grading numbers of direct products of chains
- Maximal dimensional partially ordered sets. II: Characterization of 2n- element posets with dimension n
- On the dimension of vertex labeling of \(k\)-uniform dcsl of \(k\)-uniform caterpillar
- Ordered sets with interval representation and \((m,n)\)-Ferrers relation
- Dimension and height for posets with planar cover graphs.
- Drawing orders with few slopes
- Bipolar orientations revisited
- Computing a dominating pair in an asteroidal triple-free graph in linear time
- Arbres et dimension des ordres
- Boolean dimension and local dimension
- Bin packing with ``largest in bottom constraint: tighter bounds and generalizations
- Vertex deletion into bipartite permutation graphs
- On the Weisfeiler-Leman dimension of permutation graphs
- Title not available (Why is that?)
- Convex independence in permutation graphs
- On the dimension of vertex labeling of k-uniform dcsl of an even cycle
- A characterization of two-agent Pareto representable orderings
- The Number of Plane Diagrams of a Lattice
- A Sublinear Bound on the Page Number of Upward Planar Graphs
- Confluent Hasse Diagrams
- The graph of critical pairs of a crown
- Complete edge-colored permutation graphs
- Some inequalities for orderings of acyclic digraphs
- A compact data structure and parallel algorithms for permutation graphs
- A graphical calculus for semi-groupal categories
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)
