MTH 607 – Graph Theory

Final Exam
(20 minutes + 5 minutes to upload solutions to D2L)
For full marks, your answers should be clear, precise and carefully argued. Just having “the
right idea” will only give you a passing mark.

Question 6 Prove or disprove: there is a simple bipartite planar graph with minimum degree
at least 4. If there is one, then provide an example. If such graph cannot exist, then prove it.