A new upper bound on the queuenumber of hypercubes

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 nn-dimensional hypercube QnQn can be laid out using n−3n−3 queues for n⩾8n⩾8. Our result improves the previously known result for the case n⩾8n⩾8.