3 research outputs found
Upper bound on cubicity in terms of boxicity for graphs of low chromatic number
The boxicity (respectively cubicity) of a graph is the minimum
non-negative integer , such that can be represented as an intersection
graph of axis-parallel -dimensional boxes (respectively -dimensional unit
cubes) and is denoted by (respectively ). It was shown by
Adiga and Chandran (Journal of Graph Theory, 65(4), 2010) that for any graph
, box, where
is the cardinality of the maximum independent set in .
In this note we show that . In
general, this result can provide a much better upper bound than that of Adiga
and Chandran for graph classes with bounded chromatic number. For example, for
bipartite graphs we get, .
Moreover we show that for every positive integer , there exist graphs with
chromatic number , such that for every , the value given by
our upper bound is at most times their cubicity. Thus, our upper
bound is almost tight
A sufficient condition for a graph with boxicity at most its chromatic number
A box in Euclidean -space is the Cartesian product of closed intervals
on the real line. The boxicity of a graph , denoted by , is
the minimum nonnegative integer such that can be isomorphic to the
intersection graph of a family of boxes in Euclidean -space. In this paper,
we present a sufficient condition for a graph under which
holds, where denotes the chromatic
number of . Bhowmick and Chandran (2010) proved that holds for a graph with no asteroidal triples. We prove that
holds for a graph in a special family of
circulant graphs with an asteroidal triple.Comment: 10 pages, 4 figure
On the stab number of rectangle intersection graphs
We introduce the notion of \emph{stab number} and \emph{exact stab number} of
rectangle intersection graphs, otherwise known as graphs of boxicity at most 2.
A graph is said to be a \emph{-stabbable rectangle intersection graph},
or \emph{-SRIG} for short, if it has a rectangle intersection representation
in which horizontal lines can be chosen such that each rectangle is
intersected by at least one of them. If there exists such a representation with
the additional property that each rectangle intersects exactly one of the
horizontal lines, then the graph is said to be a \emph{-exactly
stabbable rectangle intersection graph}, or \emph{-ESRIG} for short. The
stab number of a graph , denoted by , is the minimum integer
such that is a -SRIG. Similarly, the exact stab number of a graph ,
denoted by , is the minimum integer such that is a -ESRIG.
In this work, we study the stab number and exact stab number of some subclasses
of rectangle intersection graphs. A lower bound on the stab number of rectangle
intersection graphs in terms of its pathwidth and clique number is shown. Tight
upper bounds on the exact stab number of split graphs with boxicity at most 2
and block graphs are also given. We show that for , -SRIG is
equivalent to -ESRIG and for any , there is a tree which is a
-SRIG but not a -ESRIG. We also develop a forbidden structure
characterization for block graphs that are 2-ESRIG and trees that are 3-ESRIG,
which lead to polynomial-time recognition algorithms for these two classes of
graphs. These forbidden structures are natural generalizations of asteroidal
triples. Finally, we construct examples to show that these forbidden structures
are not sufficient to characterize block graphs that are 3-SRIG or trees that
are -SRIG for any