Planar posets, dimension, breadth and the number of minimal elements
From MaRDI portal
Publication:304190
DOI10.1007/s11083-015-9369-5zbMath1359.06003OpenAlexW2189573515MaRDI QIDQ304190
Rui Dong Wang, William T. jun. Trotter
Publication date: 24 August 2016
Published in: Order (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11083-015-9369-5
Related Items (7)
Tree-width and dimension ⋮ Planar posets that are accessible from below have dimension at most 6 ⋮ Trees and circle orders ⋮ Dimension of posets with planar cover graphs excluding two long incomparable chains ⋮ The graph of critical pairs of a crown ⋮ Linear extensions and comparable pairs in partial orders ⋮ Comparing Dushnik-Miller dimension, Boolean dimension and local dimension
Cites Work
- Posets with cover graph of pathwidth two have bounded dimension
- The number of depth-first searches of an ordered set
- Bipartite graphs, upward drawings, and planarity
- Adjacency posets of planar graphs
- Representing an ordered set as the intersection of super greedy linear extensions
- The dimension of planar posets
- Dimension of the crown \(S^k_n\)
- Some theorems on graphs and posets
- Complexity of diagrams
- On the complexity of diagram testing
- Dimension, graph and hypergraph coloring
- Interval orders and dimension
- The dimension of posets with planar cover graphs.
- Tree-width and dimension
- On the dimension of posets with cover graphs of treewidth 2
- Dimension and height for posets with planar cover graphs.
- Intransitive indifference with unequal indifference intervals
- On the Computational Complexity of Upward and Rectilinear Planarity Testing
- Efficient Planarity Testing
- The 3-Irreducible Partially Ordered Sets
- Topological Minors of Cover Graphs and Dimension
- Minors and Dimension
- Partial orders of dimension 2
- On the dimension of partially ordered sets
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Planar posets, dimension, breadth and the number of minimal elements
