Bounds for the chromatic number of graphs with partial information Original Research Article

We obtain bounds for the chromatic and clique numbers of a simple graph, first in terms of the number of vertices and edges it contains, and then in terms of its vertex degrees. In every case, we examine the tightness of the bounds we obtain. We also briefly discuss lower bounds for the independence number of a graph in terms of the same parameters.