The Matching Book Embedding of Biconnected Outerplanar Graphs

Abstract

The $n$-$bookembedding$ of a graph $G$ is an embedding of the graph $G$ in an $n$-book with the vertices of $G$ on the spine and each edge to the pages without crossing each other. If the degree of vertices of $G$ at most one in each page, the $n$-book embedding is $matching$. The $matchingbookthickness$ of graph $G$ is the smallest $n$ so that $G$ can be matching embedded in an $n$-book. In this paper, the matching book thickness of the biconnected outerplanar graphs is determined.

There is one very easy method to prove this result

References in corpus (1)

• Matching Book Embedding of the Cartesian Product of a Complete Graph and a Cycle

Cited by in corpus (1)

• Bipartite cubic planar graphs are dispersable