112 citations · 144 across the 30 of their papers we have counts for
Showing 2012 · cs.DMShow all
2 papers · 2 filters
cs.DM2012★ 1 cited
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…
cs.DM2012
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…