Akira Kamibeppu

activity

20132017

most citedA sufficient condition for a graph with boxicity at most its chromatic number

1 citations · 1 across the 3 of their papers we have counts for

collaborators

3 papers

math.CO2017★ 1 cited

A sufficient condition for a graph with boxicity at most its chromatic number

Akira Kamibeppu

A box in Euclidean $k$ -space is the Cartesian product of $k$ closed intervals on the real line. The boxicity of a graph $G$ , denoted by $box (G)$ , is the minimum nonnegative…

math.CO2015

A note on lower bounds for boxicity of graphs

Akira Kamibeppu

The boxicity of a graph $G$ is the minimum non-negative integer $k$ such that $G$ can be isomorphic to the intersection graph of a family of boxes in Euclidean $k$ -space, where a b…

math.CO2013

Bounds for the boxicity of Mycielski graphs

Akira Kamibeppu

A box in Euclidean $k$ -space is the Cartesian product $I_{1} \times I_{2} \times \dots \times I_{k}$ , where $I_{j}$ is a closed interval on the real line. The boxicity of a graph $G$ , denot…