bounded-degree graphs have arbitrarily large queue-number

Clicks: 80
ID: 202784
2008
Free PDF
Article Quality & Performance Metrics
Overall Quality
Not rated
Combines reader engagement with the AI quality analysis. This article has not been analysed, so there is no overall score — reader engagement is measured and shown alongside.
AI Quality Assessment
Not analyzed
Readership in this journal
Steady

Ranked #17 of 23 articles by views in Proteins

Most read Least read

Bar heights use a square-root scale.

Mint this article as an NFT
Not yet minted

Create a permanent, verifiable on-chain record of this article on the Scimatic Network. The NFT is held in your Journament account, and you can withdraw it to your own wallet at any time.

5 SUSD one-off · no wallet required
Sign in to mint
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
http://www.dmtcs.org/dmtcs-ojs/index.php/dmtcs/article/view/541
Keywords
mathematics

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.