Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

Prove that if $G$ is connected, not the complete graph and $\Delta(G) > 2$ then the chromatic number of G is at most $\Delta(G)$.

share|cite|improve this question
up vote 2 down vote accepted

Using Brook's theorem, if a graph is not complete or cyclic then $\chi(G)\leq\triangle(G)$. Since $\triangle(G)>2$, therefore $G$ is not cyclic. Hence $G$ is not complete or cyclic. Thus, $\chi(G)\leq\triangle(G)$.

share|cite|improve this answer

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.