Bounded-degree graphs have arbitrarily large queue-number

Abstract

It is proved that there exist graphs of bounded degree with arbitrarily large queue-number. In particular, for all Δ > 3 and for all sufficiently large n, there is a simple Δ-regular n-vertex graph with queue-number at least c√Δn1/2/Δ for some absolute constant c. © 2008 Discrete Mathematics and Theoretical Computer Science (DMTCS).