6 citations · 19 across the 21 of their papers we have counts for
4 papers · 1 filter
Acyclic Edge coloring of Planar Graphs
Manu Basavaraju, L. Sunil Chandran
An edge coloring of a graph is a proper edge coloring such that there are no bichromatic cycles. The \emph{acyclic chromatic index} of a graph is the minimum number k suc…
Chordal Bipartite Graphs with High Boxicity
L. Sunil Chandran, Mathew C. Francis, Rogers Mathew
The boxicity of a graph G is defined as the minimum integer k such that G is an intersection graph of axis-parallel k-dimensional boxes. Chordal bipartite graphs are bipartite grap…
Cubicity of interval graphs and the claw number
Abhijin Adiga, L. Sunil Chandran
Let be a simple, undirected graph where is the set of vertices and is the set of edges. A -dimensional cube is a Cartesian product $I_1\times I_2\times...\times…
Boxicity of Leaf Powers
L. Sunil Chandran, Mathew C. Francis, Rogers Mathew
The boxicity of a graph G, denoted as box(G) is defined as the minimum integer t such that G is an intersection graph of axis-parallel t-dimensional boxes. A graph G is a k-leaf po…