Grid Intersection Graphs and Order Dimension

  title={Grid Intersection Graphs and Order Dimension},
  author={Steven Chaplick and Stefan Felsner and Udo Hoffmann and Veit Wiechert},
We study subclasses of grid intersection graphs from the perspective of order dimension. We show that partial orders of height two whose comparability graph is a grid intersection graph have order dimension at most four. Starting from this observation we provide a comprehensive study of classes of graphs between grid intersection graphs and bipartite permutation graphs and the containment relation on these classes. Order dimension plays a role in many arguments. 
Intersection Graphs of Rays and Grounded Segments
Several classes of intersection graphs of line segments in the plane are considered and it is shown that not every intersection graph of rays is an intersections graph of downward rays, and not every outer segment graph is an intersectiongraph of rays.
Refining the Hierarchies of Classes of Geometric Intersection Graphs
Extension Properties of Graphs and Structures
The main idea of this thesis is to ask what extra information can be deduced from the structure of all possible geometric representations of graphs, namely their automorphism groups, the graph isomorphism problem and regular graph covering.
Recognition and Drawing of Stick Graphs
It is proved that G has a Stick representation if and only if there are orderings of A and B such that G’s bipartite adjacency matrix with rows A and columns B excludes three small ‘forbidden’ submatrices.
Stick graphs: examples and counter-examples
This paper proposes structural results on Stick graphs, and disapproves the idea, suggested by these examples and the other examples from the literature, that a graph which is not a Stick graph necessarily contains a hole.
Restricted String Representations
A string representation of a graph assigns to every vertex a curve in the plane so that two curves intersect if and only if the represented vertices are adjacent. This work investigates string
Characterization of B0-VPG Cocomparability Graphs and a 2D Visualization of their Posets
B 0 -VPG graphs are intersection graphs of axis-parallel line segments in the plane. Cohen et al. (Order 33 (1), 39–49, 2016 ) pose the question of characterizing B 0 -VPG permutation graphs. We
On the complexity of recognizing Stick graphs
Stick graphs are defined as follows. Let A (respectively B ) be a set of vertical (respectively horizontal) segments in the plane such that the bottom endpoints of the segments in A and the left
Forced pairs in A-Stick graphs
  • I. Rusu
  • Mathematics
    Discrete Mathematics
  • 2022


Intersection Dimension of Bipartite Graphs
This work relates well-known graph classes such as interval bigraphs, two-directional orthogonal ray graphs, chain graphs, and (unit) grid intersection graphs with respect to these dimensions and shows that the recognition problems for certain graph classes are NP-complete.
Planar graphs and poset dimension
We view the incidence relation of a graph G=(V. E) as an order relation on its vertices and edges, i.e. a<Gb if and only of a is a vertex and b is an edge incident on a. This leads to the definition
The Clique Problem in Ray Intersection Graphs
It is shown that any planar graph has an even subdivision whose complement is a ray intersection graph, which implies that finding a maximum clique in a segment intersection graph is NP-hard.
A unified approach to visibility representations of planar graphs
This work studies visibility representations of graphs, which are constructed by mapping vertices to horizontal segments, and edges to vertical segments that intersect only adjacent vertex-segments, and considers three types of visibility representations.
Unit Grid Intersection Graphs: Recognition and Properties
It is shown that even if the authors restrict to the class of unit grid intersection graphs (UGIGs), the recognition remains hard, as well as for all graph classes contained inbetween, even when considering only graphs with arbitrarily large girth.
On a Visibility Representation of Graphs
A visibility representation of graphs is given which extends some very well-known representations considered extensively in the literature and it is proved that each graph admits a visibility representation.
The dimension of a comparability graph
Dushnik and Miller defined the dimension of a partial order P as the minimum number of linear orders whose intersection is P. Ken Bogart asked if the dimension of a partial order is an invariant of
Colouring Relatives of Intervals on the Plane, II
We give exact upper bounds on the chromatic number for the intersection graphs of intervals and rays in two directions on the plane in terms of clique number.
On the Ferrers dimension of a digraph
The Order Dimension of Planar Maps Revisited
A simple result about the order dimension of grid intersection graphs is used to show a slightly stronger result that may be the first result in the area that is obtained without using the tools introduced in this short paper.