Boxicity

From Wikipedia, the free encyclopedia
Jump to: navigation, search
An intersection graph of rectangles, with boxicity two

In graph theory, boxicity is a graph invariant, introduced by Fred S. Roberts in 1969.

The boxicity of a graph is the minimum dimension in which a given graph can be represented as an intersection graph of axis-parallel boxes. That is, there must exist a one-to-one correspondence between the vertices of the graph and a set of boxes, such that two boxes intersect if and only if there is an edge connecting the corresponding vertices.

Examples[edit]

The figure shows a graph with six vertices, and a representation of this graph as an intersection graph of rectangles (two-dimensional boxes). This graph cannot be represented as an intersection graph of boxes in any lower dimension, so its boxicity is two.

Roberts (1969) showed that the graph with 2n vertices, formed by removing a perfect matching from a complete graph on 2n vertices, has boxicity exactly n: each pair of disconnected vertices must be represented by boxes that are separated in a different dimension than each other pair. A box representation of this graph with dimension exactly n can be found by thickening each of the 2n facets of an n-dimensional hypercube into a box. Because of these results, this graph has been called the Roberts graph,[1] although it is better known as the cocktail party graph and it can also be understood as the Turán graph T(2n,n).

Relation to other graph classes[edit]

A graph has boxicity at most one if and only if it is an interval graph; the boxicity of an arbitrary graph G is the minimum number of interval graphs on the same set of vertices such that the intersection of the edges sets of the interval graphs is G. Every outerplanar graph has boxicity at most two,[2] and every planar graph has boxicity at most three.[3]

If a bipartite graph has boxicity two, it can be represented as an intersection graph of axis-parallel line segments in the plane.[4]

Algorithmic results[edit]

Many graph problems can be solved or approximated more efficiently for graphs with bounded boxicity than they can for other graphs; for instance, the maximum clique problem can be solved in polynomial time for graphs with bounded boxicity.[5] For some other graph problems, an efficient solution or approximation can be found if a low-dimensional box representation is known.[6] However, finding such a representation may be difficult: it is NP-complete to test whether the boxicity of a given graph is at most some given value K, even for K = 2.[7] Chandran, Francis & Sivadasan (2006) describe algorithms for finding representations of arbitrary graphs as intersection graphs of boxes, with a dimension that is within a logarithmic factor of the maximum degree of the graph; this result provides an upper bound on the graph's boxicity.

Despite being hard for its natural parameter, boxicity is fixed-parameter tractable when parameterized by the vertex cover number of the input graph.[8]

Notes[edit]

  1. ^ E.g., see Chandran, Francis & Sivadasan (2006) and Chandran & Sivadasan (2007).
  2. ^ Scheinerman (1984).
  3. ^ Thomassen (1986).
  4. ^ Bellantoni et al. (1993).
  5. ^ Chandran, Francis & Sivadasan (2006) observe that this follows from the fact that these graphs have a polynomial number of maximal cliques. An explicit box representation is not needed to list all maximal cliques efficiently.
  6. ^ See, e.g., Agarwal, van Kreveld & Suri (1998) and Berman et al. (2001) for approximations to the maximum independent set for intersection graphs of rectangles, and Chlebík & Chlebíková (2005) for results on hardness of approximation of these problems in higher dimensions.
  7. ^ Cozzens (1981); Yannakakis (1982); Kratochvil (1994).
  8. ^ Adiga, Chitnis & Saurabh (2010).

References[edit]