3 citations · 3 across the 4 of their papers we have counts for
4 papers
A Constant Factor Approximation Algorithm for Boxicity of Circular Arc Graphs
Abhijin Adiga, Jasine Babu, L. Sunil Chandran
Boxicity of a graph is the minimum integer such that can be represented as the intersection graph of -dimensional axis parallel rectangles in . Eq…
Geometric representation of graphs in low dimension
L. Sunil Chandran, Mathew C Francis, Naveen Sivadasan
We give an efficient randomized algorithm to construct a box representation of any graph G on n vertices in dimensions, where is the maximum degree of G. We…
Boxicity and Treewidth
L. Sunil Chandran, Naveen Sivadasan
In this paper, we relate the seemingly unrelated concepts of treewidth and boxicity. Our main result is that, for any graph G, boxicity(G) <= treewidth(G) + 2. We also show that th…
Hadwiger Number and the Cartesian Product Of Graphs
L. Sunil Chandran, Alexandr Kostochka, J. Krishnam Raju
The Hadwiger number mr(G) of a graph G is the largest integer n for which the complete graph K_n on n vertices is a minor of G. Hadwiger conjectured that for every graph G, mr(G) >…