Upward three-dimensional grid drawings of graphs
From MaRDI portal
Publication:2503149
DOI10.1007/s11083-006-9028-yzbMath1098.05057arXivmath/0510051OpenAlexW1969798688MaRDI QIDQ2503149
Publication date: 14 September 2006
Published in: Order (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0510051
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Graph representations (geometric and intersection representations, etc.) (05C62)
Related Items (5)
Layered separators in minor-closed graph classes with applications ⋮ Crossings in grid drawings ⋮ Improved Bounds for Track Numbers of Planar Graphs ⋮ On the queue-number of graphs with bounded tree-width ⋮ Volume requirements of 3D upward drawings
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 3D straight-line grid drawing of 4-colorable graphs
- Three-dimensional graph drawing
- Coloring with no 2-colored \(P_4\)'s
- Computing straight-line 3D grid drawings of graphs in linear volume
- On the Computational Complexity of Upward and Rectilinear Planarity Testing
- Star coloring of graphs
- Three-Dimensional 1-Bend Graph Drawings
- Three-Dimensional Circuit Layouts
- Laying Out Graphs Using Queues
- Comparing Queues and Stacks As Machines for Laying Out Graphs
- Stack and Queue Layouts of Directed Acyclic Graphs: Part I
- Stack and Queue Layouts of Directed Acyclic Graphs: Part II
- New upper bounds on harmonious colorings
- Optimal Upward Planarity Testing of Single-Source Digraphs
- Straight-Line Drawings on Restricted Integer Grids in Two and Three Dimensions
- The Maximum Number of Edges in a Three-Dimensional Grid-Drawing
- Upward Planar Drawing of Single-Source Acyclic Digraphs
- Graph Drawing
- Graph Drawing
- Layout of Graphs with Bounded Tree-Width
- Graph Drawing
- Graph Drawing
- Graph Drawing
- Drawing graphs. Methods and models
This page was built for publication: Upward three-dimensional grid drawings of graphs