论文标题
匹配的书籍厚度哈林图
Matching Book Thickness of Halin Graphs
论文作者
论文摘要
图$ g $的\ emph {匹配书籍嵌入}是将其顶点排列在脊柱上，并将其边缘绘制到页面中，以便每个页面上的边缘不会相互互相相交，并且每个页面上的最大顶点是一个。 \ emph {匹配的书籍厚度}是图$ g $可以匹配嵌入的最小页数。在本文中，确定了匹配的书籍厚度。
The \emph{matching book embedding} of a graph $G$ is to arrange its vertices on the spine, and draw its edges into the pages so that the edges on every page do not intersect each other and the maximum degree of vertices on every page is one. The \emph{matching book thickness} is the minimum number of pages in which the graph $G$ can be matching embedded. In this paper, the matching book thickness of Halin graphs is determined.
