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

DOI10.1016/S0020-0190(97)00098-7MaRDI QIDQ287145zbMATH OpenFDO

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

Recommendations

• scientific article; zbMATH DE number 1241845
• scientific article; zbMATH DE number 2145229
• Graph Drawing
• Computing straight-line 3D grid drawings of graphs in linear volume
• Drawing with colors

Cites work

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

Cited in

(4)

• Drawing with colors
• Computing straight-line 3D grid drawings of graphs in linear volume
• Volume requirements of 3D upward drawings
• Upward three-dimensional grid drawings of graphs

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

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