Linear layouts of complete graphs

DOI10.1007/978-3-030-92931-2_19OpenAlexW4205376253MaRDI QIDQ2151449

Laura Merker, Torsten Ueckerdt, Pavel Valtr, Stefan Felsner

Publication date: 1 July 2022

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

zbMATH Keywords

complete graphspage numberqueue numberlocal covering numbersstack numberunion covering numbers

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cites Work

• Three ways to cover a graph
• The book thickness of a graph
• On the pagenumber of complete bipartite graphs
• Local and union boxicity
• On difference graphs and the local dimension of posets
• Local and union page numbers
• Pagenumber of complete bipartite graphs
• Laying Out Graphs Using Queues
• Comparing Queues and Stacks As Machines for Laying Out Graphs
• On Covering Numbers, Young Diagrams, and the Local Dimension of Posets
• The Local Queue Number of Graphs with Bounded Treewidth

This page was built for publication: Linear layouts of complete graphs