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.
A four-page abstract of an earlier version of this paper appeared in the proceedings of the 28th European Workshop on Computational Geometry EuroCG ’12 [1]. The booklet of abstracts is available here: http://www.diei.unipg.it/eurocg2012/ booklet.pdf
Chapter PDF
Similar content being viewed by others
References
Balko, M.: Grid representations and the chromatic number. In: 28th European Workshop on Computational Geometry, EuroCG 2012, pp. 45–48 (2012)
Cáceres, J., Cortés, C., Grima, C.I., Hachimori, M., Márquez, A., Mukae, R., Nakamoto, A., Negami, S., Robles, R., Valenzuela, J.: Compact Grid Representation of Graphs. In: Márquez, A., Ramos, P., Urrutia, J. (eds.) EGC 2011. LNCS, vol. 7579, pp. 166–174. Springer, Heidelberg (2012)
Chappell, G.G., Gimbel, J., Hartman, C.: Thresholds for path colorings of planar graphs. Topics in Discrete Mathematics, 435–454 (2006)
Chrobak, M., Nakano, S.: Minimum-width grid drawings of plane graphs. Computational Geometry 11, 29–54 (1995)
Flores Pen̋aloza, D., Zaragoza Martinez, F.J.: Every four-colorable graph is isomorphic to a subgraph of the visibility graph of the integer lattice. In: Proceedings of the 21st Canadian Conference on Computational Geometry, CCCG 2009, pp. 91–94 (2009)
de Fraysseix, H., Pach, J., Pollack, R.: How to draw a planar graph on a grid. Combinatorica 10(1), 41–51 (1990)
Goddard, W.: Acyclic colorings of planar graphs. Discrete Math. 91, 91–94 (1991)
Kára, J., Pór, A., Wood, D.R.: On the chromatic number of the visibility graph of a set of points in the plane. Discrete Comput. Geom. 34, 497–506 (2005)
Lovász, L.: On decomposition of graphs. Studia Math. Hung. 1, 237–238 (1966)
Pór, A., Wood, D.R.: No-three-in-line-in-3d. Algorithmica 47, 481–488 (2007)
Schnyder, W.: Embedding planar graphs on the grid. In: Proceedings of the First Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 1990, pp. 138–148. Society for Industrial and Applied Mathematics (1990)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Balko, M. (2013). Grid Drawings and the Chromatic Number. In: Didimo, W., Patrignani, M. (eds) Graph Drawing. GD 2012. Lecture Notes in Computer Science, vol 7704. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-36763-2_28
Download citation
DOI: https://doi.org/10.1007/978-3-642-36763-2_28
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-36762-5
Online ISBN: 978-3-642-36763-2
eBook Packages: Computer ScienceComputer Science (R0)