论文标题
匹配的书籍嵌入双连接的外平面图
The Matching Book Embedding of Biconnected Outerplanar Graphs
论文作者
论文摘要
$ n $ - $ book〜嵌入图$ g $的$嵌入图$ g $中的$ n $ - 书本中，脊柱上的顶点为$ g $，而每个边缘都不相互交叉。如果每页最多最多的顶点$ g $，则$ n $书本的嵌入为$匹配$。 $匹配〜书籍〜厚度$ g $ g $是最小的$ 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.
