Adjacency posets of outerplanar graphs
From MaRDI portal
Publication:2659249
Abstract: Felsner, Li and Trotter showed that the dimension of the adjacency poset of an outerplanar graph is at most 5, and gave an example of an outerplanar graph whose adjacency poset has dimension 4. We improve their upper bound to 4, which is then best possible.
Recommendations
Cites work
- scientific article; zbMATH DE number 53952 (Why is no real title available?)
- scientific article; zbMATH DE number 863477 (Why is no real title available?)
- 3-interval irreducible partially ordered sets
- Adjacency posets of planar graphs
- Better bounds for poset dimension and boxicity
- Boxicity of graphs on surfaces
- Dimension, graph and hypergraph coloring
- Planar graphs and poset dimension
- Posets and planar graphs
- The Order Dimension of Convex Polytopes
- The Order Dimension of Planar Maps
Cited in
(4)
This page was built for publication: Adjacency posets of outerplanar graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2659249)