An Inequality for Generalized Chromatic Graphs

Abstract

Let G be a simple n-vertex graph with degree sequence d1, d2, . . . , dn and vertex set V(G). The degree of v ∈ V(G) is denoted by d(v). The smallest integer r for which V(G) has an r-partitionIn this note we prove the inequality