Bounded-degree graphs have arbitrarily large queue-numberArticle
Authors: David R. Wood 1
0000-0001-8866-3041
David R. Wood
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.
Steven Chaplick;Krzysztof Fleszar;Fabian Lipp;Alexander Ravsky;Oleg Verbitsky;et al., 2020, Drawing graphs on few lines and few planes, 11, 1, pp. 433-475, 10.20382/jocg.v11i1a17.
Michael Bekos;Henry Förster;Martin Gronemann;Tamara Mchedlidze;Fabrizio Montecchiani;et al., Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, Planar graphs of bounded degree have bounded queue number, pp. 176-184, 2019, Phoenix AZ USA, 10.1145/3313276.3316324.