2 citations · 2 across the 1 of their papers we have counts for
1 paper
Arnab Char, T. Karthick
In this paper, we are interested in some problems related to chromatic number and clique number for the class of (P5,K5−e)-free graphs, and prove the following. (a) If G is…