Matching Book Thickness of Halin Graphs
Combinatorics
2022-08-30 v2
Abstract
The \emph{matching book embedding} of a graph 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 can be matching embedded. In this paper, the matching book thickness of Halin graphs is determined.
Keywords
Cite
@article{arxiv.2008.13331,
title = {Matching Book Thickness of Halin Graphs},
author = {Zeling Shao and Huiru Geng and Zhiguo Li},
journal= {arXiv preprint arXiv:2008.13331},
year = {2022}
}
Comments
The proof in the manuscripts can be simplified