5 citations · 12 across the 6 of their papers we have counts for
7 papers · 1 filter
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…
Every Elementary Graph is Chromatic Choosable
Nandana K Vasudevan, K Somasundaram, J Geetha
Elementary graphs are graphs whose edges can be colored using two colors in such a way that the edges in any induced get distinct colors. They constitute a subclass of the cl…
Total, Equitable Total and Neighborhood sum distinguishing Total Colorings of Some Classes of Circulant Graphs
S. Prajnanaswaroopa, J. Geetha, K. Somasundaram
In this paper, we have obtained the total chromatic as well as equitable and neighborhood sum distinguishing total chromatic numbers of some classes of the circulant graphs.
Total Coloring for some classes of Cayley graphs
Prajnanaswaroopa S, Geetha J, Somasundaram K
The Total coloring conjecture states that any simple graph G with maximum degree D can be totally colored with at most D+2 colors. In this paper, we have obtained the total chromat…
Total Coloring of some classes of Powers of Cycles
Prajnanaswaroopa S, J Geetha, K Somasundaram +2
In this paper, we have obtained the total chromatic number of some classes of Cayley graphs, odd graphs and mock threshold graphs.
Total Colourings - A survey
Geetha Jayabalan, Narayanan N, K Somasundaram
The smallest integer needed for the assignment of colors to the elements so that the coloring is proper (vertices and edges) is called the total chromatic number of a graph. Vi…