Partition the vertices by the parity of the number of one-bits. Every edge reverses that parity, giving a two-colouring; at least two colours are needed because an edge exists. Therefore the vertex chromatic number is two.

Ancestors (13)

  1. ii
  2. 1
  3. R
  4. 2009
  5. Past exam of the probability, statistics and options I course of the University of Oxford
  6. Probability, statistics and options I course of the University of Oxford
  7. Year 2 of the mathematics and statistics course of the University of Oxford
  8. Mathematics and statistics course of the University of Oxford
  9. Undergraduate course of the University of Oxford
  10. Course of the University of Oxford
  11. University of Oxford
  12. List of universities
  13. 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