112 citations · 112 across the 3 of their papers we have counts for
3 papers
math.CO2026
Off-diagonal Rado number for and
Rajat Adak, Yash Bakshi, L. Sunil Chandran +1
Ramsey-type problems for linear equations began with Schur's theorem and were systematically generalized by Richard Rado. In the off-diagonal framework for two colors, one consider…
math.CO2010★ 112 cited
Rainbow Connection Number and Connected Dominating Sets
L. Sunil Chandran, Anita Das, Deepak Rajendraprasad +1
Rainbow connection number rc(G) of a connected graph G is the minimum number of colours needed to colour the edges of G, so that every pair of vertices is connected by at least one…
math.CO2008
Acyclic Edge Coloring of Graphs with Maximum Degree 4
Manu Basavaraju, L. Sunil Chandran
An edge coloring of a graph is a proper edge coloring such that there are no bichromatic cycle s. The \emph{acyclic chromatic index} of a graph is the minimum number k su…