Abstract
A graph has boxicity k if k is the smallest integer such that G is an intersection graph of k-dimensional boxes in a k-dimensional space (where the sides of the boxes are parallel to the coordinate axis). A graph has grid dimension k if k is the smallest integer such that G is an intersection graph of k-dimensional boxes (parallel to the coordinate axis) in a ( k + 1)-dimensional space. We prove that all bipartite graphs with boxicity two, have grid dimensions one, that is, they can be represented as intersection graphs of horizontal and vertical intervals in the plane. We also introduce some inequalities for the grid dimension of a graph, and discuss extremal graphs with large grid dimensions.
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.
