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.

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

If a graph is planar, them what is the maximum degree any of its vertices can have ? Also, can a planar graph have chromatic number more than 4 based on the Vizing theorem ?Isn't vizing theorem a contradiction to the Four Color Problem ?

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

There is no maximum degree for planar graph: the $n$-star (one vertex connected to $n$ others) is always planar, and the central vertex has degree $n$.

This is not in contradiction with the four-color theorem, because Vizing speaks about edge chromatic nunmber, whille the 4-color property is about vertex chromatic number.

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.