Bounded-degree graphs have arbitrarily large queue-number

David R. Wood (1)

1 Departament de Matemàtica Aplicada II

It is proved that there exist graphs of bounded degree with arbitrarily large queue-number. In particular, for all \Delta ≥ 3 and for all sufficiently large n, there is a simple \Delta-regular n-vertex graph with queue-number at least c√\Delta_n^{1/2-1/\Delta} for some absolute constant c.

Domaines: Mathématique discrète [cs.DM]

David R. Wood. Bounded-degree graphs have arbitrarily large queue-number. Discrete Mathematics and Theoretical Computer Science, 2008, Vol. 10 no. 1 (1), pp.27--34. ⟨10.46298/dmtcs.434⟩. ⟨hal-00972310⟩