Adjacency posets of outerplanar graphs

DOI10.1016/J.DISC.2021.112338zbMATH Open1460.05054arXiv2001.09497OpenAlexW3132186476MaRDI QIDQ2659249FDOQ2659249

Authors: Marcin Witkowski 

Publication date: 25 March 2021

Published in: Discrete Mathematics (Search for Journal in Brave)

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.

Full work available at URL: https://arxiv.org/abs/2001.09497

Recommendations

• Adjacency posets of planar graphs
• The dimension of posets with planar cover graphs.
• Posets and planar graphs
• On the order dimension of outerplanar maps
• Planar posets that are accessible from below have dimension at most 6

zbMATH Keywords

dimensionouterplanar graphposetadjacency posetincidence posetrealizer

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Combinatorics of partially ordered sets (06A07)

Cites Work

• Planar graphs and poset dimension
• Title not available (Why is that?)
• Title not available (Why is that?)
• Boxicity and poset dimension
• Dimension, graph and hypergraph coloring
• Boxicity of graphs on surfaces
• Adjacency posets of planar graphs
• The Order Dimension of Planar Maps
• The Order Dimension of Convex Polytopes
• Posets and planar graphs
• Better bounds for poset dimension and boxicity
• 3-interval irreducible partially ordered sets

Cited In (4)

• Title not available (Why is that?)
• Adjacency posets of planar graphs
• Posets and planar graphs
• On the general position numbers of maximal outerplane graphs

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)