A new upper bound on the queuenumber of hypercubes

Abstract: A queue layout of a graph consists of a linear order of its vertices, and a partition of its edges into queues, such that no two edges in the same queue are nested. In this paper, we show that the -dimensional hypercube can be laid out using queues for . Our result improves the previously known result for the case . [Copyright &y& Elsevier]