Textbook: Introduction to Graph Theory by Robert J. Wilson 5th Edition Pg. 91

4.17 Let G be a simple plane graph with fewer than 12 faces, in which each vertex has degree at least 3. () Use Euler's formula to prove that G has a face bounded by at most four edges. (i) Give an example to show that the result of part (i) is false if G has 12 faces