Planar Graphs Have Bounded Queue-Number
From MaRDI portal
Publication:5133977
DOI10.1145/3385731zbMath1466.05047arXiv1904.04791OpenAlexW3103394879MaRDI QIDQ5133977
Gwenaël Joret, Vida Dujmović, Torsten Ueckerdt, Piotr Micek, Pat Morin, David R. Wood
Publication date: 11 November 2020
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1904.04791
Planar graphs; geometric and topological aspects of graph theory (05C10) Graph minors (05C83) Graph operations (line graphs, products, etc.) (05C76)
Related Items (38)
Improved bounds for weak coloring numbers ⋮ Clustered 3-colouring graphs of bounded degree ⋮ Note on strong product graph dimension ⋮ Twin-width II: small classes ⋮ Stack-number is not bounded by queue-number ⋮ Recognizing and embedding simple optimal 2-planar graphs ⋮ On the queue-number of partial orders ⋮ On the queue number of planar graphs ⋮ An improved planar graph product structure theorem ⋮ The mixed page number of graphs ⋮ Fan-crossing free graphs and their relationship to other beyond-planar graphs ⋮ A fast algorithm for the product structure of planar graphs ⋮ Separating layered treewidth and row treewidth ⋮ Improved product structure for graphs on surfaces ⋮ Sparse universal graphs for planarity ⋮ The Rique-number of graphs ⋮ Shallow Minors, Graph Products, and Beyond-Planar Graphs ⋮ An improved upper bound on the queue number of planar graphs ⋮ Packing topological minors half‐integrally ⋮ The product structure of squaregraphs ⋮ Graph product structure for non-minor-closed classes ⋮ Linear layouts of bipartite planar graphs ⋮ Recognizing map graphs of bounded treewidth ⋮ Graph theory. Abstracts from the workshop held January 2--8, 2022 ⋮ On fractional fragility rates of graph classes ⋮ Two Results on Layered Pathwidth and Linear Layouts ⋮ Improved Bounds for Centered Colorings ⋮ Notes on graph product structure theory ⋮ Planar Graphs of Bounded Degree Have Bounded Queue Number ⋮ Shorter Labeling Schemes for Planar Graphs ⋮ Quasi-planar Graphs ⋮ Edge Partitions and Visibility Representations of 1-planar Graphs ⋮ On mixed linear layouts of series-parallel graphs ⋮ 1-planarity testing and embedding: an experimental study ⋮ The Local Queue Number of Graphs with Bounded Treewidth ⋮ Parameterized Algorithms for Queue Layouts ⋮ Lazy Queue Layouts of Posets ⋮ On Mixed Linear Layouts of Series-Parallel Graphs
This page was built for publication: Planar Graphs Have Bounded Queue-Number
