Recall that two graphs are homeomorphic if they have isomorphic subdivisions.
It is well known that every graph is homeomorphic to a graph of book
thickness at most three (see Atneosen [1]}, Bernhart and Kainen [2]}, and,
according to Jozef Przytycki, also a dissertation by G. Hotz, a student of
Reidemeister). Applications of three-page embeddings have been made to
links by Dynnikov [3]}.
