申論題

二、 Only simple graphs are considered in this problem.

(b)  Determine whether there exists a connected planar graph that contains 7 vertices, without an Euler cycle, and with the chromatic number equal to 3. If so, draw the graph and prove its correctness. Otherwise, prove there is no such a graph.