Bounded-degree graphs have arbitrarily large queue-number
Copyright policy )Bounded-degree graphs have arbitrarily large queue-number
Graphs and Algorithms 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.
[INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM], QA1-939, FOS: Mathematics, [info.info-dm] computer science [cs]/discrete mathematics [cs.dm], Mathematics - Combinatorics, Combinatorics (math.CO), 05C62, Mathematics
[INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM], QA1-939, FOS: Mathematics, [info.info-dm] computer science [cs]/discrete mathematics [cs.dm], Mathematics - Combinatorics, Combinatorics (math.CO), 05C62, Mathematics
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).3 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Average impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!