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

I need to order the vertexes of a planar graph so that the greedy algorithm would colour the vertexes using 6 colours.Could you please give some sugestions or hints to what could I start with ?

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

Order the vertices according to their degrees and you have the Welsh-Powell alogrithm that gives a 6-coloring if the max degree is 5 or less.

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.