Abstract
A grid drawing of a graph maps vertices to the grid Zd and edges to line segments that avoid grid points representing other vertices. We show that a graph G is qd-colorable, d, q⩾2, if and only if there is a grid drawing of G in Zd 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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
