Adjacency posets of planar graphs

In this paper, we show that the dimension of the adjacency poset of a planar graph is at most 8. From below, we show that there is a planar graph whose adjacency poset has dimension 5. We then show that the dimension of the adjacency poset of an outerplanar graph is at most 5. From below, we show that there is an outerplanar graph whose adjacency poset has dimension 4. We also show that the dimension of the adjacency poset of a planar bipartite graph is at most 4. This result is best possible. More generally, the dimension of the adjacency poset of a graph is bounded as a function of its genus and so is the dimension of the vertex-face poset of such a graph.

• Type: Journal
• Year: 2010
• Where: DM
• Authors: Stefan Felsner, Ching Man Li, William T. Trotter
• Keywords: Adjacency Poset, Dimension, DM 2010, Planar Graph