Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
6423925 | Electronic Notes in Discrete Mathematics | 2011 | 6 Pages |
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 Ï. 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.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Petr Gregor, Riste Å krekovski, Vida VukaÅ¡inoviÄ,