3D straight-line grid drawing of 4-colorable graphs

DOI10.1016/S0020-0190(97)00098-7zbMath1337.68266MaRDI QIDQ287145

Tiziana Calamoneri, Andrea Sterbini

Publication date: 26 May 2016

Published in: Information Processing Letters (Search for Journal in Brave)

zbMATH Keywords

computational geometry\(k\)-colorable graphsstraight-line grid drawing

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Coloring of graphs and hypergraphs (05C15)

Related Items (3)

Computing straight-line 3D grid drawings of graphs in linear volume ⋮ Upward three-dimensional grid drawings of graphs ⋮ Volume requirements of 3D upward drawings

Cites Work

• Three-dimensional orthogonal graph drawing algorithms
• Drawing with colors
• Computing proximity drawings of trees in the 3-dimensional space

This page was built for publication: 3D straight-line grid drawing of 4-colorable graphs