The queue-number of posets of bounded width or height

DOI10.1007/978-3-030-04414-5_14zbMath1453.06002arXiv1806.04489OpenAlexW2963909391MaRDI QIDQ1725753

Torsten Ueckerdt, Kolja Knauer, Piotr Micek

Publication date: 15 February 2019

Full work available at URL: https://arxiv.org/abs/1806.04489

Mathematics Subject Classification ID

Combinatorics of partially ordered sets (06A07) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (5)

On the queue-number of partial orders ⋮ Queue layouts of two-dimensional posets ⋮ Lazy queue layouts of posets ⋮ The queue-number of posets of bounded width or height ⋮ Lazy Queue Layouts of Posets

Cites Work

• Characterisations and examples of graph classes with bounded expansion
• Bipartite graphs, upward drawings, and planarity
• N-free posets as generalizations of series-parallel posets
• The queue-number of posets of bounded width or height
• Intransitive indifference with unequal indifference intervals
• A decomposition theorem for partially ordered sets
• Laying Out Graphs Using Queues
• Comparing Queues and Stacks As Machines for Laying Out Graphs
• Stack and Queue Layouts of Posets
• Partial orders of dimension 2
• Unnamed Item
• Unnamed Item

This page was built for publication: The queue-number of posets of bounded width or height