TY - JOUR
T1 - Embedding Cartesian Product of Some Graphs in Books
AU - Yang , Jiao
AU -  Shao , Zeling
AU - Li , Zhiguo
JO - Communications in Mathematical Research 
VL - 3
SP - 253
EP - 260
PY - 2019
DA - 2019/12
SN - 34
DO - http://doi.org/10.13447/j.1674-5647.2018.03.07
UR - https://global-sci.org/intro/article_detail/cmr/13496.html
KW - book embedding, cartesian product, pagenumber
AB - <p style="text-align: justify;">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.</p>