bounded-degree graphs have arbitrarily large queue-number
Clicks: 50
ID: 202784
2008
Article Quality & Performance Metrics
Overall Quality
Improving Quality
0.0
/100
Combines engagement data with AI-assessed academic quality
Reader Engagement
Emerging Content
12.3
/100
41 views
7 readers
Trending
AI Quality Assessment
Not analyzed
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 √ Δ n 1/2-1/Δ for some absolute constant c.
| Reference Key |
wood2008discretebounded-degree
Use this key to autocite in the manuscript while using
SciMatic Manuscript Manager or Thesis Manager
|
|---|---|
| Authors | ;David R. Wood |
| Journal | Proteins |
| Year | 2008 |
| DOI |
DOI not found
|
| URL | |
| Keywords |
Citations
No citations found. To add a citation, contact the admin at info@scimatic.org
Comments
No comments yet. Be the first to comment on this article.