A new upper bound for the chromatic number of a graph
Ingo Schiermeyer · Discussiones Mathematicae Graph Theory · 2007
Let G be a graph of order n with clique number !(G); chromatic number ´(G) and independence number fi(G): We show that ´(G) • n+!+1ifi 2 : Moreover, ´(G) • n+!ifi 2 ; if either ! + fi = n + 1 and G is not a split graph or fi+! = ni1 and G contains no induced K!+3iC5: