1. Jordan Curve Theorem A simple closed curve cuts its interior from its exterior.

2. Theorem 6.3.1

5. Dual Graph The dual graph G* if a plane graph is a plane graph whose vertices corresponding to the faces of G. The edges of G* corresponds to the edges of G as follows: if e is an edge of G with face X on one side and face Y on the other side, then the endpoints of the dual edge e* in E(G*) are the vertices x and y of G* that represents the faces X and Y of G.  K4K4

6. Proper Face-Coloring

7. Proper 3-edge-Coloring

8. Theorem 7.3.2

13. Theorem 7.3.4

14. Tait Coloring

15. Tait’s Conjecture

16. Grinberg’s Sufficient Condition

17. Grinberg’s Condition

19. Example 7.3.6

22. Are Planar Graph 4-Colorable? The four color theorem was proven using a computer, and the proof is not accepted by all mathematicians because it would be unfeasible for a human to verify by hand. Ultimately, in order to believe the proof, one has to have faith in the correctness of the compiler and hardware executing the program used for the proof. (see http://en.wikipedia.org/wiki/Four_color_theorem) See pages 258-260 in the text book.