Boxicity

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…

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2018

In this paper, we focus on two recently introduced parameters in the literature, namely `local boxicity' (a parameter on graphs…

2016

2015

The game of cops and robber, introduced by Nowakowski and Winkler in 1983, is played by two players on a graph. One controls k…

2015

We define and study a class of graphs, called 2-stab interval graphs (2SIG), with boxicity 2 which properly contains the class of…

2012

A family F of permutations of the vertices of a hypergraph H is called "pairwise suitable" for H if, for every pair of disjoint…

2012

The boxicity of a graph G = (V, E) is the least integer k for which there exist k interval graphs Gi = (V, Ei), 1 ≤ i ≤ k, such…

2009

The boxicity of a graph G, denoted as boxi(G), is defined as the minimum integer t such that G is an intersection graph of axis…

2008

The boxicity of a graph G, denoted as box(G), is the minimum dimension d for which each vertex of G can be mapped to a d…

2005

1989

In this note, we consider the use of intervals to represent two classes of highly symmetric graphs, in fact with n!-fold symmetry…