The pagenumber of toroidal graphs is at most seven (Q1377749)

A book embedding of a graph is an ordering of its vertices along the spine of the book and an embedding of each edge of the graph on a single page, so that edges on the same page do not intersect. The author shows that every toroidal graph can be embedded in a book of 7 pages and conjectures that there is a toroidal graph needing 7 pages (so that the pagenumber of toroidal graphs would be 7).