2020/08/31 by Zeling Shao, Yanqing Liu, Shao, Zeling +3
Computer Science · #05C10 #Advanced Graph Theory Research #Combinatorics (math.CO) #FOS: Mathematics #Graph Labeling and Dimension Problems #Interconnection Networks and Systems
paper · pdf · doi:10.48550/arxiv.2008.13324
openalex publication_date 2020/08/31 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.