The Maximum Number of Edges in a Three-Dimensional Grid-Drawing

DOI10.7155/JGAA.00079MaRDI QIDQ4679078zbMATH OpenOpenAlexFDO

Authors 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)

Copyright license Creative Commons Attribution 4.0 International

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

zbMATH Keywords

grid-drawing

Mathematics Subject Classification ID

Graph representations (geometric and intersection representations, etc.) (05C62) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Graph Drawing
• scientific article; zbMATH DE number 2145229
• scientific article; zbMATH DE number 1241845
• Bounds For Orthogonal 3-D Graph Drawing
• Three-Dimensional 1-Bend Graph Drawings

Cited in

(11)

• Volume requirements of 3D upward drawings
• Maximum number of edges joining vertices on a cube
• Three-dimensional maximal and boundary ghosts
• Computing straight-line 3D grid drawings of graphs in linear volume
• Layered separators in minor-closed graph classes with applications
• Upward three-dimensional grid drawings of graphs
• Crossings in grid drawings
• Combinational numerical methods with minimum discretization error
• Connecting the maximum number of grid nodes to the boundary with non-intersecting line segments
• On the queue-number of graphs with bounded tree-width
• scientific article; zbMATH DE number 2208609 (Why is no real title available?)

This page was built for publication: The Maximum Number of Edges in a Three-Dimensional Grid-Drawing

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