Erratum to “A new upper bound on the queuenumber of hypercubes” [Discrete Math. 310 (2010) 935–939]

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 σ. We show that the n-dimensional hypercube Qn has a layout into n − log 2 n queues for all n ≥ 1. On the other hand, for every ε > 0, every queue layout of Qn has more than ( 1 2 − ε)n − O(1/ε) queues and, in particular, more than (n − 2)/3 queues. This improves previously known upper and lower bounds on the minimal number of queues in a queue layout of Qn. For the lower bound we employ a new technique of out-in representations and contractions which may be of independent interest.

show abstract

scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.

Contact Info

customersupport@researchsolutions.com

10624 S. Eastern Ave., Ste. A-614

Henderson, NV 89052, USA

This site is protected by reCAPTCHA and the Google Privacy Policy and Terms of Service apply.

Blog Terms and Conditions API Terms Privacy Policy Contact Cookie Preferences Do Not Sell or Share My Personal Information

Made with 💙 for researchers

Part of the Research Solutions Family.

Erratum to “A new upper bound on the queuenumber of hypercubes” [Discrete Math. 310 (2010) 935–939]

Cited by 2 publications

References 2 publications

On the queue-number of the hypercube

On the queue-number of the hypercube

Queue Layouts of Hypercubes

Contact Info

Product

Resources

About