A of a graph consists of a linear ordering of the vertices along a line in 3-space (the ), and an assignment of edges to half-planes with the spine as boundary (the ), so that edges assigned to the same page can be drawn on that page without crossings. Given a graph = (), let : → ℕ be a...