A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
In this paper, we show that any incomplete hypercube with, at most, 2 n + 2 n−1 + 2 n−2 vertices can be embedded in n − 1 pages for all n ≥ 4. For the case n ≥ 4, this result improves Fang and Lai's result that any incomplete hypercube with, at most, 2 n + 2 n−1 vertices can be embedded in n − 1 pages for all n ≥ 2. Besides this, we show that the result can be further improved when n is largee.g., any incomplete hypercube with at most 2 n + 2 n−1 + 2 n−2 + 2 n−7 (respectively, 2 n + 2 n−1 + 2doi:10.1016/j.dam.2008.10.008 fatcat:oq64mtmeargsnewktqljcqd3my