Singer Island, FL
Oct. 24, 1984 to Oct. 26, 1984
L. Heath , University of North Carolina
This paper investigates the problem of embedding planar graphs in books of few pages. An efficient algorithm for embedding a planar graph in a book establishes an upper bound of seven pages for any planar graph. This disproves a conjecture of Bernhart and Kainen that the pagenumber of a planar graph can be arbitrarily large. It is also shown that the stellations of K/sub 3/ have pagenumber three, the best possible.
L. Heath, "Embedding Planar Graphs In Seven Pages", FOCS, 1984, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science 1984, pp. 74-83, doi:10.1109/SFCS.1984.715903