8 citations · 28 across the 19 of their papers we have counts for
1 paper · 2 filters
C. U. Angeliya, Arnab Char, T. Karthick
A class of graphs G is said to be \emph{near optimal colorable} if there exists a constant c∈N such that every graph G∈G satisfies $χ(G) \leq \max\{c…