1 paper · 1 filter
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\{…