Queue layouts of planar 3-trees

DOI10.1007/S00453-020-00697-4MaRDI QIDQ5918924zbMATH OpenOpenAlexFDO

Authors

Publication date 3 September 2020

Published in Algorithmica (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/s00453-020-00697-4

zbMATH Keywords

constant queue numberplanar 3-treesqueue layouts

Mathematics Subject Classification ID

Trees (05C05) Planar graphs; geometric and topological aspects of graph theory (05C10) Enumeration in graph theory (05C30)

Recommendations

• Queue layouts of planar 3-trees
• An improved upper bound on the queue number of planar graphs
• Graph layouts via layered separators
• On the Queue Number of Planar Graphs
• On the queue-number of graphs with bounded tree-width

Cites work

• Comparing Queues and Stacks As Machines for Laying Out Graphs
• Computing straight-line 3D grid drawings of graphs in linear volume
• Drawing graphs. Methods and models
• Embedding planar graphs in four pages
• Graph Drawing
• Graph layouts via layered separators
• scientific article; zbMATH DE number 2123123 (Why is no real title available?)
• scientific article; zbMATH DE number 1241845 (Why is no real title available?)
• scientific article; zbMATH DE number 1954397 (Why is no real title available?)
• scientific article; zbMATH DE number 2044931 (Why is no real title available?)
• scientific article; zbMATH DE number 2159655 (Why is no real title available?)
• Laying Out Graphs Using Queues
• Layout of Graphs with Bounded Tree-Width
• Minimum-area drawings of plane 3-trees
• Mixed linear layouts of planar graphs
• On Crossing Sets, Disjoint Sets, and Pagenumber
• On the Queue Number of Planar Graphs
• On the queue-number of graphs with bounded tree-width
• Planar graphs of bounded degree have bounded queue number
• Queue layouts of planar 3-trees
• Sorting Using Networks of Queues and Stacks
• Stacks, queues and tracks: layouts of graph subdivisions
• Straight-Line Drawings on Restricted Integer Grids in Two and Three Dimensions
• Tree-partitions of k-trees with applications in graph layout.

Cited in

(19)

• On mixed linear layouts of series-parallel graphs
• On the queue number of planar graphs
• The mixed page number of graphs
• An improved upper bound on the queue number of planar graphs
• Lazy queue layouts of posets
• The Local Queue Number of Graphs with Bounded Treewidth
• Lazy Queue Layouts of Posets
• Improved bounds for track numbers of planar graphs
• On the queue-number of graphs with bounded tree-width
• Queue layouts of graph products and powers
• Queue layouts of planar 3-trees
• The Rique-number of graphs
• Graph product structure for non-minor-closed classes
• Linear layouts of bipartite planar graphs
• On families of planar DAGs with constant stack number
• Graph product structure for \(h\)-framed graphs
• An improved upper bound on the queue number of the folded hypercube
• On the twin-width of outerplanar graphs
• Queue layouts on folded hypercubes

This page was built for publication: Queue layouts of planar 3-trees

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