12.8. Another Characterization for Planar Graphs 497
a
b
d
c
e e
figure 1 figure 2
figure 3 figure 4
a
b
d
c
a
b
d
c
a
b
d
c
Figure 12.18
Homework Problems
Problem 12.8.
A simple graph istriangle-freewhen it has no cycle of length three.
(a)Prove for any connected triangle-free planar graph withv > 2vertices ande
edges,
e2v 4: (12.9)
(b)Show that any connected triangle-free planar graph has at least one vertex of
degree three or less.
(c)Prove that any connected triangle-free planar graph is 4-colorable.