@article{185,
  author = {Saıd Bettayeb, David Hoelzeman},
  title = {Upper and Lower bounds on the Pagenumber of the Book Embedding of the k-ary Hypercube},
  journal = {Journal of Digital Information Management},
  year = {2009},
  volume = {7},
  number = {1},
  doi = {},
  url = {http://www.dirf.org/jdim/v7n1a5.asp},
  abstract = {Graph embeddings play an important role in interconnection network and VLSI design. Determining the number of layers required to build a VLSI chip is just one of the many areas in which graph embeddings are used. A type of embedding that is helpful in determining the number of layers is a book embedding. We develop upper and lower bounds on the pagenumber of a book embedding of the k-ary hypercube along with an upper bound on the cumulative pagewidth.},
}