11 citations · 27 across the 12 of their papers we have counts for
14 papers
Elementary graphs are chromatic-choosable
Narayanan N, Nandana K. Vasudevan, K. Somasundaram
A graph is \emph{elementary} if its edges can be coloured with two colours so that the two edges of every induced path on three vertices receive different colours. Elementary graph…
List-Coloring and Chromatic-Choosability -- A Dynamic Survey
Nandana K Vasudevan, K Somasundaram, N Narayanan
List-coloring, introduced independently by Vizing and by Erdős, Rubin, and Taylor in the 1970s, generalizes ordinary vertex coloring by assigning to each vertex its own set of admi…
Proper -caterpillars are distinguished by their Chromatic Symmetric Functions
G. Arunkumar, Narayanan Narayanan, Raghavendra Rao B. V. +1
Stanley's Tree Isomorphism Conjecture posits that the chromatic symmetric function can distinguish non-isomorphic trees. While already established for caterpillars and other subcla…
On distinguishing digraphs by its quasisymmetric B-polynomial
N. Narayanan, Sagar S. Sawant
The -polynomial defined by J. Awan and O. Bernardi is a generalization of Tutte Polynomial to digraphs. In this paper, we solve an open question raised by J. Awan and O. Bernard…
Strong edge coloring of Cayley graphs and some product graphs
Suresh Dara, Suchismita Mishra, Narayanan Narayanan +1
A strong edge coloring of a graph is a proper edge coloring of such that every color class is an induced matching. The minimum number of colors required is termed the stron…
Exact square coloring of subcubic planar graphs
Florent Foucaud, Hervé Hocquard, Suchismita Mishra +4
We study the exact square chromatic number of subcubic planar graphs. An exact square coloring of a graph G is a vertex-coloring in which any two vertices at distance exactly 2 rec…