Two dual faces of a plane graph share an edge exactly when their corresponding original vertices are adjacent. Their face-adjacency graph is therefore the original tree, which is a nontrivial bipartite graph. Colour the face for with one colour and alternate along the original tree. This gives a proper face colouring with two colours, and at least two are needed because there is an edge separating distinct faces. Hence the minimum is
(1)

Ancestors (13)

  1. iv
  2. 2
  3. R
  4. 2007
  5. Past exam of the Probability, statistics and options II course of the University of Oxford
  6. Probability, statistics and options II 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