5 citations · 5 across the 2 of their papers we have counts for
Showing math.COShow all
2 papers · 1 filter
math.CO2021
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…
math.CO2018★ 5 cited
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…