Bounded-Degree Graphs have Arbitrarily Large Queue-Number
Combinatorics
2008-09-09 v2
Abstract
It is proved that there exist graphs of bounded degree with arbitrarily large queue-number. In particular, for all and for all sufficiently large , there is a simple -regular -vertex graph with queue-number at least for some absolute constant .
Keywords
Cite
@article{arxiv.math/0601293,
title = {Bounded-Degree Graphs have Arbitrarily Large Queue-Number},
author = {David R. Wood},
journal= {arXiv preprint arXiv:math/0601293},
year = {2008}
}