10 citations · 12 across the 3 of their papers we have counts for
5 papers · 1 filter
Pairwise Suitable Family of Permutations and Boxicity
Manu Basavaraju, L. Sunil Chandran, Rogers Mathew +1
A family F of permutations of the vertices of a hypergraph H is called "pairwise suitable" for H if, for every pair of disjoint edges in H, there exists a permutation in F in which…
Product Dimension of Forests and Bounded Treewidth Graphs
L. Sunil Chandran, Rogers Mathew, Deepak Rajendraprasad +1
The product dimension of a graph G is defined as the minimum natural number l such that G is an induced subgraph of a direct product of l complete graphs. In this paper we study th…
On Rainbow Connection Number and Connectivity
L. Sunil Chandran, Rogers Mathew, Deepak Rajendraprasad
Rainbow connection number, , of a connected graph is the minimum number of colours needed to colour its edges, so that every pair of vertices is connected by at least on…
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…
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…