Bounded-Degree Graphs have Arbitrarily Large Queue-Number
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 √ Δ n 1/2-1/Δ for some absolute constant c.
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Discrete Mathematics & Theoretical Computer Science
2008-01-01
|
| Series: | Discrete Mathematics & Theoretical Computer Science |
| Online Access: | http://www.dmtcs.org/dmtcs-ojs/index.php/dmtcs/article/view/541 |
| id |
doaj-8f9d884a94dd48bab4eb7dfcda54283c |
|---|---|
| record_format |
Article |
| spelling |
doaj-8f9d884a94dd48bab4eb7dfcda54283c2020-11-24T23:44:24ZengDiscrete Mathematics & Theoretical Computer ScienceDiscrete Mathematics & Theoretical Computer Science1462-72641365-80502008-01-01101Bounded-Degree Graphs have Arbitrarily Large Queue-NumberDavid R. WoodIt 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 √ Δ n 1/2-1/Δ for some absolute constant c. http://www.dmtcs.org/dmtcs-ojs/index.php/dmtcs/article/view/541 |
| collection |
DOAJ |
| language |
English |
| format |
Article |
| sources |
DOAJ |
| author |
David R. Wood |
| spellingShingle |
David R. Wood Bounded-Degree Graphs have Arbitrarily Large Queue-Number Discrete Mathematics & Theoretical Computer Science |
| author_facet |
David R. Wood |
| author_sort |
David R. Wood |
| title |
Bounded-Degree Graphs have Arbitrarily Large Queue-Number |
| title_short |
Bounded-Degree Graphs have Arbitrarily Large Queue-Number |
| title_full |
Bounded-Degree Graphs have Arbitrarily Large Queue-Number |
| title_fullStr |
Bounded-Degree Graphs have Arbitrarily Large Queue-Number |
| title_full_unstemmed |
Bounded-Degree Graphs have Arbitrarily Large Queue-Number |
| title_sort |
bounded-degree graphs have arbitrarily large queue-number |
| publisher |
Discrete Mathematics & Theoretical Computer Science |
| series |
Discrete Mathematics & Theoretical Computer Science |
| issn |
1462-7264 1365-8050 |
| publishDate |
2008-01-01 |
| description |
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 √ Δ n 1/2-1/Δ for some absolute constant c. |
| url |
http://www.dmtcs.org/dmtcs-ojs/index.php/dmtcs/article/view/541 |
| work_keys_str_mv |
AT davidrwood boundeddegreegraphshavearbitrarilylargequeuenumber |
| _version_ |
1725498734700134400 |