Grid drawings of \(k\)-colourable graphs

DOI10.1016/j.comgeo.2004.06.001zbMath1065.65043OpenAlexW2016199536MaRDI QIDQ706720

David R. Wood

Publication date: 9 February 2005

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.comgeo.2004.06.001

zbMATH Keywords

graph drawingaspect ratiogrid drawingsno-three-in-line problemcolourable graph

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Coloring of graphs and hypergraphs (05C15)

Related Items (5)

Area requirement of graph drawings with few crossings per edge ⋮ The extensible no-three-in-line problem ⋮ Area, curve complexity, and crossing resolution of non-planar graph drawings ⋮ Grid drawings of graphs with constant edge-vertex resolution ⋮ Large Angle Crossing Drawings of Planar Graphs in Subquadratic Area

Cites Work

• On a Problem of Heilbronn
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Grid drawings of \(k\)-colourable graphs