3 papers
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…
cs.DM2020
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…
math.CO2017
Coloring (, diamond, )-free graphs
T. Karthick, Suchismita Mishra
We show that every (, diamond, )-free graph is -colorable. Moreover, we give an example of a (, diamond, )-free graph with . This generalizes s…