$h$-Planar graphs

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 …