小面非平面图的少页书嵌入
Book Embeddings of Nonplanar Graphs with Small Faces in Few Pages
摘要:
一个图在书中的嵌入,称为书嵌入,由它的顶点沿着书的书脊的线性排序和它的边到书的页面的分配组成,使得同一页面上的两条边不交叉。图的书厚是所有书嵌入的最小页数。对于平面图,一个基本的结果是由于Yannakakis,他提出了一个算法来计算平面图在四页书中的嵌入。我们的主要贡献是一种技术,推广这一结果到一个更广泛的家庭的非平面图,其特征在于由一个双连接的骨架的交叉自由的边缘,其面有界度。值得注意的是,这个族包括所有的1-平面图,所有的最优2-平面图和所有的k-映射(k有界)图作为子图。我们证明了这类图的书厚有界,作为推论,我们得到了最优2-平面图和k-映射图的书厚的第一个常数上界。
英文摘要:
An embedding of a graph in a book, called book embedding, consists of a linear ordering of its vertices along the spine of the book and an assignment of its edges to the pages of the book, so that no two edges on the same page cross. The book thickness of a graph is the minimum number of pages over all its book embeddings. For planar graphs, a fundamental result is due to Yannakakis, who proposed an algorithm to compute embeddings of planar graphs in books with four pages. Our main contribution is a technique that generalizes this result to a much wider family of nonplanar graphs, which is characterized by a biconnected skeleton of crossing-free edges whose faces have bounded degree. Notably, this family includes all 1-planar, all optimal 2-planar, and all k-map (with bounded k) graphs as subgraphs. We prove that this family of graphs has bounded book thickness, and as a corollary, we obtain the first constant upper bound for the book thickness of optimal 2-planar and k-map graphs.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。