Abstract
A queue layout of a graph consists of a linear ordering of its vertices, and a partition of its edges into sets, called queues, such that in each set no two edges are nested with respect to the ordering. A queue-number of G is the minimal number of queues in a queue layout of G.
We improve previously known upper and lower bounds on the queue-number of the hypercube.