AbstractWe show that the class of unit grid intersection graphs properly includes both of the classes of interval bigraphs and of P6-free chordal bipartite graphs. We also demonstrate that the classes of unit grid intersection graphs and of chordal bipartite graphs are incomparable
AbstractA proper interval bigraph is a bigraph where to each vertex we can assign a closed interval ...
An intersection graph is a graph whose vertices are in bijective correspondence to a collection of s...
AbstractWe consider the following question: Given a family of sets, is there a positive integer, t, ...
AbstractWe give a short, elementary proof that the interval bigraphs are a strict subclass of the un...
AbstractA bipartite graph G = (X, Y; E) has a grid representation if X and Y correspond to sets of h...
AbstractWe give a short, elementary proof that the interval bigraphs are a strict subclass of the un...
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 ...
Abstract. It has been known since 1991 that the problem of recognizing grid intersection graphs is N...
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...
AbstractAn interval bigraph is an undirected bipartite graph whose edge set is the intersection of t...
AbstractA graph has boxicity k if k is the smallest integer such that G is an intersection graph of ...
AbstractA bipartite graph G = (X, Y; E) has a grid representation if X and Y correspond to sets of h...
We study a variant of intersection representations with unit balls: unit disks in the plane and unit...
AbstractA proper interval bigraph is a bigraph where to each vertex we can assign a closed interval ...
An intersection graph is a graph whose vertices are in bijective correspondence to a collection of s...
AbstractWe consider the following question: Given a family of sets, is there a positive integer, t, ...
AbstractWe give a short, elementary proof that the interval bigraphs are a strict subclass of the un...
AbstractA bipartite graph G = (X, Y; E) has a grid representation if X and Y correspond to sets of h...
AbstractWe give a short, elementary proof that the interval bigraphs are a strict subclass of the un...
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 ...
Abstract. It has been known since 1991 that the problem of recognizing grid intersection graphs is N...
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...
AbstractAn interval bigraph is an undirected bipartite graph whose edge set is the intersection of t...
AbstractA graph has boxicity k if k is the smallest integer such that G is an intersection graph of ...
AbstractA bipartite graph G = (X, Y; E) has a grid representation if X and Y correspond to sets of h...
We study a variant of intersection representations with unit balls: unit disks in the plane and unit...
AbstractA proper interval bigraph is a bigraph where to each vertex we can assign a closed interval ...
An intersection graph is a graph whose vertices are in bijective correspondence to a collection of s...
AbstractWe consider the following question: Given a family of sets, is there a positive integer, t, ...