Adjacency posets of planar graphs
From MaRDI portal
Publication:966048
Recommendations
Cites work
- scientific article; zbMATH DE number 432759 (Why is no real title available?)
- scientific article; zbMATH DE number 53952 (Why is no real title available?)
- scientific article; zbMATH DE number 2109336 (Why is no real title available?)
- scientific article; zbMATH DE number 863477 (Why is no real title available?)
- 3-interval irreducible partially ordered sets
- An acyclic analogue to Heawood's theorem
- Convex drawings of planar graphs and the order dimension of 3-polytopes
- Dimension, graph and hypergraph coloring
- Geodesic embeddings and planar graphs
- On acyclic colorings of graphs on surfaces
- On the complexity of posets
- Planar graphs and poset dimension
- Schnyder woods and orthogonal surfaces
- The Order Dimension of Convex Polytopes
- The Order Dimension of Planar Maps
- The dimension of planar posets
Cited in
(18)- Planar graphs and poset dimension
- Forcing posets with large dimension to contain large standard examples
- Posets with cover graph of pathwidth two have bounded dimension
- Planar posets, dimension, breadth and the number of minimal elements
- Adjacency posets of outerplanar graphs
- Posets and planar graphs
- Minors and dimension
- Trees and circle orders
- Boxicity and topological invariants
- The dimension of posets with planar cover graphs.
- On the order dimension of outerplanar maps
- Boxicity of graphs on surfaces
- Tree-width and dimension
- Planar order on vertex poset
- Dimension and height for posets with planar cover graphs.
- Boxicity, poset dimension, and excluded minors
- Boolean dimension and local dimension
- Dimension and height for posets with planar cover graphs
This page was built for publication: Adjacency posets of planar graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q966048)