论文信息 - A Trade-off between Page Number and Page Width of Book Embeddings of Graphs

A Trade-off between Page Number and Page Width of Book Embeddings of Graphs

Abstract In this paper we describe for any n ≥ 3 a family of graphs possessing a book embedding using n pages—but only with unbounded page width. However, if one uses one additional page, then the page width can be kept bounded by a constant.

Elena Stöhr

[1] Paul C. Kainen,et al. The book thickness of a graph , 1979, J. Comb. Theory, Ser. B.

[2] Peter W. Shor,et al. On the pagenumber of planar graphs , 1984, STOC '84.

[3] Arnold L. Rosenberg,et al. The Diogenes Approach to Testable Fault-Tolerant Arrays of Processors , 1983, IEEE Transactions on Computers.

[4] Mihalis Yannakakis,et al. Four pages are necessary and sufficient for planar graphs , 1986, Symposium on the Theory of Computing.

[5] Arnold L. Rosenberg. The Diogenes design methodology: toward automatic physical layout , 1986 .

[6] Lenwood S. Heath. Embedding Planar Graphs in Seven Pages , 1984, FOCS.

[7] Lenwood S. Heath. Embedding outerplanar graphs in small books , 1987 .

[8] Arnold L. Rosenberg,et al. Embedding graphs in books: a layout problem with applications to VLSI design , 1985 .