An improved upper bound on the queuenumber of the hypercube

In this note, we show that the n-dimensional hypercube Q(n) can be laid out using n-2 queues for all n>=5. Our result improves the previously known result for the case n>=5.