Grid representations and the chromatic number

From MaRDI portal
Publication:2391545

DOI10.1016/J.COMGEO.2013.05.003zbMATH Open1269.05079arXiv1204.0210OpenAlexW2964044475MaRDI QIDQ2391545FDOQ2391545

Martin Balko

Publication date: 31 July 2013

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

Abstract: A grid drawing of a graph maps vertices to grid points and edges to line segments that avoid grid points representing other vertices. We show that there is a number of grid points that some line segment of an arbitrary grid drawing must intersect. This number is closely connected to the chromatic number. Second, we study how many columns we need to draw a graph in the grid, introducing some new NP-complete problems. Finally, we show that any planar graph has a planar grid drawing where every line segment contains exactly two grid points. This result proves conjectures asked by David Flores-Pe~naloza and Francisco Javier Zaragoza Martinez.


Full work available at URL: https://arxiv.org/abs/1204.0210





Cites Work


Cited In (4)


Recommendations





This page was built for publication: Grid representations and the chromatic number

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