Minors and dimension
From MaRDI portal
Publication:345115
DOI10.1016/j.jctb.2016.09.001zbMath1350.05159arXiv1407.4066OpenAlexW1692549677MaRDI QIDQ345115
Publication date: 25 November 2016
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1407.4066
Related Items (8)
Planar posets that are accessible from below have dimension at most 6 ⋮ Trees and circle orders ⋮ Boolean dimension and local dimension ⋮ Planar Posets Have Dimension at Most Linear in Their Height ⋮ Dimension is polynomial in height for posets with planar cover graphs ⋮ Dimension of posets with planar cover graphs excluding two long incomparable chains ⋮ Better bounds for poset dimension and boxicity ⋮ Excluding a ladder
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Posets with cover graph of pathwidth two have bounded dimension
- Graph minors. XX: Wagner's conjecture
- Adjacency posets of planar graphs
- On the dimensions of ordered sets of bounded degree
- The dimension of planar posets
- Graph minors. XVI: Excluding a non-planar graph
- Diameter and treewidth in minor-closed graph families
- On-line dimension for posets excluding two long incomparable chains
- A theory of recursive dimension of ordered sets
- Tree-width and dimension
- On the dimension of posets with cover graphs of treewidth 2
- Local tree-width, excluded minors, and approximation algorithms
- Dimension and height for posets with planar cover graphs.
- The Complexity of the Partial Order Dimension Problem
- Approximation algorithms for NP-complete problems on planar graphs
- Sparsity and dimension
- Topological Minors of Cover Graphs and Dimension
- Structure Theorem and Isomorphism Test for Graphs with Excluded Topological Subgraphs
- Partially Ordered Sets
- On the dimension of partially ordered sets
This page was built for publication: Minors and dimension
