The Maximum Number of Edges in a Three-Dimensional Grid-Drawing
From MaRDI portal
Publication:4679078
DOI10.7155/jgaa.00079zbMath1061.05064OpenAlexW2135989110MaRDI QIDQ4679078
Prosenjit Bose, Jurek Czyzowicz, Pat Morin, David R. Wood
Publication date: 25 May 2005
Published in: Journal of Graph Algorithms and Applications (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/51249
Graph theory (including graph drawing) in computer science (68R10) Graph representations (geometric and intersection representations, etc.) (05C62)
Related Items (6)
Computing straight-line 3D grid drawings of graphs in linear volume ⋮ Layered separators in minor-closed graph classes with applications ⋮ Crossings in grid drawings ⋮ On the queue-number of graphs with bounded tree-width ⋮ Upward three-dimensional grid drawings of graphs ⋮ Volume requirements of 3D upward drawings
This page was built for publication: The Maximum Number of Edges in a Three-Dimensional Grid-Drawing
