The following pages link to The dimension of planar posets (Q1217722):
Displaying 36 items.
- Forcing posets with large dimension to contain large standard examples (Q293603) (← links)
- Posets with cover graph of pathwidth two have bounded dimension (Q304175) (← links)
- Planar posets, dimension, breadth and the number of minimal elements (Q304190) (← links)
- Minors and dimension (Q345115) (← links)
- Steiner transitive-closure spanners of low-dimensional posets (Q397071) (← links)
- Comparing Dushnik-Miller dimension, Boolean dimension and local dimension (Q781526) (← links)
- Boolean dimension, components and blocks (Q781531) (← links)
- On locally presented posets (Q913830) (← links)
- Bipartite graphs, upward drawings, and planarity (Q918730) (← links)
- Adjacency posets of planar graphs (Q966048) (← links)
- Algorithms for plane representations of acyclic digraphs (Q1124349) (← links)
- Some theorems on graphs and posets (Q1223323) (← links)
- Maximal dimensional partially ordered sets. III: A characterization of Hiraguchi's inequality for interval dimension (Q1229735) (← links)
- On the complexity of posets (Q1235192) (← links)
- A data structure for lattice representation (Q1392212) (← links)
- Trees and circle orders (Q1688275) (← links)
- Boolean dimension and local dimension (Q1690054) (← links)
- Dimension of posets with planar cover graphs excluding two long incomparable chains (Q1734698) (← links)
- Fractional dimension of partial orders (Q1803664) (← links)
- Representing posets with \(k\)-tournaments (Q1815842) (← links)
- Tight bounds to localize failure nodes on trees, grids and through embeddings under Boolean network tomography (Q2136288) (← links)
- Dimension of restricted classes of interval orders (Q2163840) (← links)
- Recognizing simple-triangle graphs by restricted 2-chain subgraph cover (Q2181225) (← links)
- Local dimension is unbounded for planar posets (Q2213803) (← links)
- Improved bound for the dimension of posets of treewidth two (Q2279268) (← links)
- The graph of critical pairs of a crown (Q2279688) (← links)
- The dimension of posets with planar cover graphs. (Q2354607) (← links)
- Tree-width and dimension (Q2400108) (← links)
- On the dimension of posets with cover graphs of treewidth 2 (Q2407679) (← links)
- Strategy-proof aggregation rules and single peakedness in bounded distributive lattices (Q2417403) (← links)
- Dimension and height for posets with planar cover graphs. (Q2509772) (← links)
- Boolean dimension and tree-width (Q2658384) (← links)
- Planar posets that are accessible from below have dimension at most 6 (Q2663166) (← links)
- On the dimension of vertex labeling of k-uniform dcsl of an even cycle (Q4634123) (← links)
- On the dimension of vertex labeling of $k$-uniform dcsl of $k$-uniform caterpillar (Q5740301) (← links)
- Dimension is polynomial in height for posets with planar cover graphs (Q6187346) (← links)
