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
AbstractWe allow orders (ordered sets) to be infinite. An interval order is an order that does not c...
Graphs and AlgorithmsIn this paper we discuss the bounds of and relations among various kinds of int...
In this paper we discuss the bounds of and relations among various kinds of intersection numbers of ...
We study subclasses of grid intersection graphs from the perspective of order dimension. We show tha...
We investigate the Ferrers dimension of classes of grid intersection graphs and show properties and ...
We investigate the Ferrers dimension of classes of grid intersection graphs and show properties and ...
We introduce a concept of intersection dimension of a graph with respect to a graph class. This gene...
We introduce a concept of intersection dimension of a graph with respect to a graph class. This gene...
Given a partial order Q, its semiorder dimension is the smallest number of semiorders whose intersec...
AbstractA graph has boxicity k if k is the smallest integer such that G is an intersection graph of ...
Abstract. Schnyder characterized planar graphs in terms of order dimension. This seminal result foun...
An interval k-graph is the intersection graph of a family of intervals of the real line partitioned ...
An interval k-graph is the intersection graph of a family of intervals of the real line partitioned ...
An interval k-graph is the intersection graph of a family of intervals of the real line partitioned ...
We show that the intersection dimension of graphs with respect to several hereditary properties can ...
AbstractWe allow orders (ordered sets) to be infinite. An interval order is an order that does not c...
Graphs and AlgorithmsIn this paper we discuss the bounds of and relations among various kinds of int...
In this paper we discuss the bounds of and relations among various kinds of intersection numbers of ...
We study subclasses of grid intersection graphs from the perspective of order dimension. We show tha...
We investigate the Ferrers dimension of classes of grid intersection graphs and show properties and ...
We investigate the Ferrers dimension of classes of grid intersection graphs and show properties and ...
We introduce a concept of intersection dimension of a graph with respect to a graph class. This gene...
We introduce a concept of intersection dimension of a graph with respect to a graph class. This gene...
Given a partial order Q, its semiorder dimension is the smallest number of semiorders whose intersec...
AbstractA graph has boxicity k if k is the smallest integer such that G is an intersection graph of ...
Abstract. Schnyder characterized planar graphs in terms of order dimension. This seminal result foun...
An interval k-graph is the intersection graph of a family of intervals of the real line partitioned ...
An interval k-graph is the intersection graph of a family of intervals of the real line partitioned ...
An interval k-graph is the intersection graph of a family of intervals of the real line partitioned ...
We show that the intersection dimension of graphs with respect to several hereditary properties can ...
AbstractWe allow orders (ordered sets) to be infinite. An interval order is an order that does not c...
Graphs and AlgorithmsIn this paper we discuss the bounds of and relations among various kinds of int...
In this paper we discuss the bounds of and relations among various kinds of intersection numbers of ...