Take the 2-minute tour ×
Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

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|improve this question
add comment

1 Answer 1

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|improve this answer
add comment

Your Answer

 
discard

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.