112 citations · 144 across the 30 of their papers we have counts for
4 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…
2-connecting Outerplanar Graphs without Blowing Up the Pathwidth
Jasine Babu, Manu Basavaraju, L. Sunil Chandran +1
Given a connected outerplanar graph G of pathwidth p, we give an algorithm to add edges to G to get a supergraph of G, which is 2-vertex-connected, outerplanar and of pathwidth O(p…
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…
Rainbow Colouring of Split and Threshold Graphs
L. Sunil Chandran, Deepak Rajendraprasad
A rainbow colouring of a connected graph is a colouring of the edges of the graph, such that every pair of vertices is connected by at least one path in which no two edges are colo…