Adjacency posets of outerplanar graphs
Combinatorics
2022-03-09 v3
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.
Cite
@article{arxiv.2001.09497,
title = {Adjacency posets of outerplanar graphs},
author = {Marcin Witkowski},
journal= {arXiv preprint arXiv:2001.09497},
year = {2022}
}