Every vertex has degree three, so its incident edges require three distinct colours. Three suffice by colouring an edge according to which of the three coordinates changes; every vertex has exactly one edge of each coordinate type. Thus the edge chromatic number is three.

Ancestors (14)

  1. b
  2. ii
  3. 1
  4. R
  5. 2009
  6. Past exam of the probability, statistics and options I course of the University of Oxford
  7. Probability, statistics and options I course of the University of Oxford
  8. Year 2 of the mathematics and statistics course of the University of Oxford
  9. Mathematics and statistics course of the University of Oxford
  10. Undergraduate course of the University of Oxford
  11. Course of the University of Oxford
  12. University of Oxford
  13. List of universities
  14. Home

View article source

Discussion (0) New discussion

There are no discussions about this article yet.

Articles by others on the same topic (0)

There are currently no matching articles.
See all articles in the same topic Create my own version