@article {170,
	title = {Upper and lower bounds on the pagenumber of the book embedding of the k-ary hypercube},
	journal = {Journal of Digital Information Management},
	volume = {7},
	year = {2009},
	note = {Cited By (since 1996):2Export Date: 10 July 2014},
	month = {2009},
	pages = {30 - 34},
	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.},
	keywords = {Book embedding, Graph embedding, Hypercube},
	url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-70350635831\&partnerID=40\&md5=91db3d618f5fa9711898a49d98f347a1},
	author = {Bettayeb, S. and Hoelzeman, D.}
}
