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 ...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 Pm × Sn, Pm × Wn, Cn × Sm, Cn × Wm, and get an upper bound of their pagenumber.展开更多
The book-embedding problem arises in several area,such as very large scale integration(VLSI)design and routing multilayer printed circuit boards(PCBs).It can be used into various practical application fields.A book em...The book-embedding problem arises in several area,such as very large scale integration(VLSI)design and routing multilayer printed circuit boards(PCBs).It can be used into various practical application fields.A book embedding of a graph G is an embedding of its vertices along the spine of a book,and an embedding of its edges to the pages such that edges embedded on the same page do not intersect.The minimum number of pages in which a graph G can be embedded is called the pagenumber or book-thickness of the graph G.It is an important measure of the quality for book-embedding.It is NP-hard to research the pagenumber of book-embedding for a graph G.This paper summarizes the studies on the book-embedding of planar graphs in recent years.展开更多
基金The NSF(A2015202301)HUSTP(ZD201506)RFHED(QN2016044)of Hebei Province
文摘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 Pm × Sn, Pm × Wn, Cn × Sm, Cn × Wm, and get an upper bound of their pagenumber.
文摘The book-embedding problem arises in several area,such as very large scale integration(VLSI)design and routing multilayer printed circuit boards(PCBs).It can be used into various practical application fields.A book embedding of a graph G is an embedding of its vertices along the spine of a book,and an embedding of its edges to the pages such that edges embedded on the same page do not intersect.The minimum number of pages in which a graph G can be embedded is called the pagenumber or book-thickness of the graph G.It is an important measure of the quality for book-embedding.It is NP-hard to research the pagenumber of book-embedding for a graph G.This paper summarizes the studies on the book-embedding of planar graphs in recent years.
