Grid Drawings and the Chromatic Number

Balko, Martin (2013) Grid Drawings and the Chromatic Number. In: 20th International Symposium, GD 2012, September 19-21, 2012 , pp. 315-326(Official URL: http://link.springer.com/chapter/10.1007/978-3-642...).

Full text not available from this repository.

Abstract

A grid drawing of a graph maps vertices to the grid $ℤ^d$ and edges to line segments that avoid grid points representing other vertices. We show that a graph G is $q^d$ -colorable, $d, q ≥ 2$, if and only if there is a grid drawing of G in $ℤ^d$ in which no line segment intersects more than q grid points. This strengthens the result of D. Flores Pen̋aloza and F. J. Zaragoza Martinez. Second, we study grid drawings with a bounded number of columns, 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 D. Flores Pen̋aloza and F. J. Zaragoza Martinez.

Item Type: Conference Paper
Additional Information: 10.1007/978-3-642-36763-2_28
Classifications: G Algorithms and Complexity > G.070 Area / Edge Length
P Styles > P.720 Straight-line
Divisions: UNSPECIFIED
Depositing User: Administration GDEA
Date Deposited: 21 Nov 2013 16:34
Last Modified: 21 Nov 2013 16:34
URI: http://gdea.informatik.uni-koeln.de/id/eprint/1320

Actions (login required)

View Item View Item