1. [1] G.A. Atneosen, On the Embeddability of Compacta in n-Books, Ph.D. Dissertation, Michigan State University, 1968.
2. [2] F. Bernhart and P.C. Kainen, “The book thickness of a graph,” J. Combi. Theory B, vol.27, no.3, pp.320-331, 1979. 10.1016/0095-8956(79)90021-2
3. [3] V. Dujmović and D.R. Wood, “On linear layouts of graphs,” Discrete Math. Theor. Comp. Sci., vol.6, no.2, pp.339-358, 2004.
4. [4] V. Dujmović and D.R. Wood, “Stacks, queues and tracks: Layouts of graph subdivisions,” Discrete Math. Theor. Comp. Sci., vol.7, pp.155-202, 2005.
5. [5] H. Enomoto and M.S. Miyauchi, “Embedding a graph into a three-page book with O(mlog n) edge-crossings over the spine,” SIAM J. Discrete Math., vol.12, no.3, pp.337-341, 1999. 10.1137/s0895480195280319