Year: 2018
Author: Jiao Yang, Zeling Shao, Zhiguo Li
Communications in Mathematical Research , Vol. 34 (2018), Iss. 3 : pp. 253–260
Abstract
The book embedding of a graph $G$ consists of placing the vertices of $G$ in a line called spine and assigning edges of the graph to pages so that the edges assigned to the same page do not intersect. The number of pages is the minimum number in which the graph can be embedded. In this paper, we study the book embedding of the Cartesian product $P_m\times S_n$, $P_m\times W_n$, $C_n\times S_m$, $C_n\times W_m$, and get an upper bound of their pagenumber.
You do not have full access to this article.
Already a Subscriber? Sign in as an individual or via your institution
Journal Article Details
Publisher Name: Global Science Press
Language: English
DOI: https://doi.org/10.13447/j.1674-5647.2018.03.07
Communications in Mathematical Research , Vol. 34 (2018), Iss. 3 : pp. 253–260
Published online: 2018-01
AMS Subject Headings: Global Science Press
Copyright: COPYRIGHT: © Global Science Press
Pages: 8
Keywords: book embedding cartesian product pagenumber