scientific article; zbMATH DE number 2159655

zbMath1066.68095MaRDI QIDQ4667621

Attila Pór, David R. Wood, Vida Dujmović

Publication date: 20 April 2005

Full work available at URL: https://eudml.org/doc/124871

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

book embeddinggraph drawinggraph layoutgeometric thicknessthree-dimensional graph drawingqueue layouttrack-numberpage-numberqueue-numberstack-numberstack layouttrack layoutbook-thickness

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items (31)

Stack-number is not bounded by queue-number ⋮ On the queue number of planar graphs ⋮ Computing straight-line 3D grid drawings of graphs in linear volume ⋮ Layered separators in minor-closed graph classes with applications ⋮ Queue layouts of iterated line directed graphs ⋮ Crossings in grid drawings ⋮ The Complexity of Drawing Graphs on Few Lines and Few Planes ⋮ Queue layouts of two-dimensional posets ⋮ Topological Graph Layouts into a Triangular Prism ⋮ An improved upper bound on the queue number of planar graphs ⋮ Track Layout Is Hard ⋮ Linear layouts of bipartite planar graphs ⋮ 2-Layer Graph Drawings with Bounded Pathwidth ⋮ Improved Bounds for Track Numbers of Planar Graphs ⋮ Line and plane cover numbers revisited ⋮ The queue-number of posets of bounded width or height ⋮ Graph layouts via layered separators ⋮ Characterisations and examples of graph classes with bounded expansion ⋮ Two Results on Layered Pathwidth and Linear Layouts ⋮ Track layouts, layered path decompositions, and leveled planarity ⋮ Cubic Planar Graphs that cannot be Drawn on few Lines ⋮ Simultaneous graph embedding with bends and circular arcs ⋮ Acyclically 3-colorable planar graphs ⋮ Layouts of Expander Graphs ⋮ Upward three-dimensional grid drawings of graphs ⋮ Queue layouts of planar 3-trees ⋮ Queue layouts of planar 3-trees ⋮ 2-colored point-set embeddings of partial 2-trees ⋮ Volume requirements of 3D upward drawings ⋮ 2-colored point-set embeddings of partial 2-trees ⋮ Planar Graphs of Bounded Degree Have Bounded Queue Number

This page was built for publication: