13 citations · 52 across the 53 of their papers we have counts for
6 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…
Isoperimetric Sequences for Infinite Complete Binary Trees, Meta-Fibonacci Sequences and Signed Almost Binary Partitions
L. Sunil Chandran, Anita Das, Frank Ruskey
In this paper we demonstrate connections between three seemingly unrelated concepts. (1) The discrete isoperimetric problem in the infinite binary tree with all the leaves at the s…
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…
Parameterized and Approximation Algorithms for Boxicity
Abhijin Adiga, Jasine Babu, L. Sunil Chandran
Boxicity of a graph , denoted by , is the minimum integer such that can be represented as the intersection graph of axis parallel boxes in …