双连通外平面图的匹配书嵌入
The Matching Book Embedding of Biconnected Outerplanar Graphs
摘要：
图$G$的$n$ - $book ~embedding$是图$G$在$n$ -书中的嵌入，其中$G$的顶点在书脊上，并且每个边到页面而不彼此交叉。如果$G$的顶点的度在每一页中至多为一，则$n$ -书嵌入为$matching$ .图$G$的$matching~ book~ thickness$是最小的$n$，使得$G$可以匹配嵌入到一个$n$ -书中。本文确定了双连通外平面图的匹配书厚。
英文摘要：
The $n$-$book ~embedding$ 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 $matching~ book~ thickness$ 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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
