5 citations · 5 across the 1 of their papers we have counts for
3 papers
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.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…
math.AC2018
An upper bound for the regularity of binomial edge ideals of trees
A. V. Jayanthan, N. Narayanan, B. V. Raghavendra Rao
In this article we obtain an improved upper bound for the regularity of binomial edge ideals of trees.