Prove that for every graph G, X(G) <= n(G) - &(G) + 1. Let X(G) denote the chromatic number of G Let n(G) denote the number of vertices of G Let &(G) denote the max size of an indepent set of vertives in G
Follow Math Help Forum on Facebook and Google+
View Tag Cloud