Book Embeddings of Nonplanar Graphs with Small Faces in Few Pages

17 Mar 2020 Bekos Michael A. Da Lozzo Giordano Griesbach Svenja Gronemann Martin Montecchiani Fabrizio Raftopoulou Chrysanthi

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... (read more)

PDF Abstract
No code implementations yet. Submit your code now

Categories


  • COMPUTATIONAL GEOMETRY