Bounded-degree graphs have arbitrarily large queue-number

MaRDI QIDQ5387727zbMATH OpenFDO

Authors David R. Wood

Publication date 27 May 2008

Full work available at URL https://arxiv.org/abs/math/0601293, https://www.dmtcs.org/dmtcs-ojs/index.php/dmtcs/issue/view/87/showToc.html

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Graph representations (geometric and intersection representations, etc.) (05C62)

Recommendations

• Planar graphs of bounded degree have bounded queue number
• Planar graphs of bounded degree have bounded queue number
• On the queue-number of graphs with bounded tree-width
• On the Queue Number of Planar Graphs
• Planar graphs have bounded queue-number

Cited in

(11)

• Notes on graph product structure theory
• Stack-number is not bounded by queue-number
• Layered separators in minor-closed graph classes with applications
• Bounded-degree graphs can have arbitrarily large slope numbers
• Crossings in grid drawings
• Graph layouts via layered separators
• On the queue-number of graphs with bounded tree-width
• Planar graphs of bounded degree have bounded queue number
• Forbidden patterns in mixed linear layouts
• Transforming stacks into queues: mixed and separated layouts of graphs
• Linear layouts of graphs with priority queues

This page was built for publication: Bounded-degree graphs have arbitrarily large queue-number

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5387727)