Cáceres González, JoséGrima Ruiz, Clara IsabelCortés Parejo, María del CarmenHachimori, MasahiroMárquez Pérez, AlbertoMukae, RaijiNakamoto, AtsuhiroNegami, SeiyaRobles Arias, RafaelValenzuela Muñoz, Jesús2016-02-022016-02-022011http://hdl.handle.net/11441/33827A graph G is said to be grid locatable if it admits a representation such that vertices are mapped to grid points and edges to line segments that avoid grid points but the extremes. Additionally G is said to be properly embeddable in the grid if it is grid locatable and the segments representing edges do not cross each other. We study the area needed to obtain those representations for some graph families.application/pdfengAttribution-NonCommercial-NoDerivatives 4.0 Internacionalhttp://creativecommons.org/licenses/by-nc-nd/4.0/graph drawinggrid locatablegrid embeddablechromatic numberinfo:eu-repo/semantics/bookPartinfo:eu-repo/semantics/openAccesshttps://doi.org/10.1007/978-3-642-34191-5_16