00:01
We're given a graph and we're asked to determine if the graph is planar and if so to draw the graph so that no edges cross.
00:10
The graph we're given is on eight vertices labeled a, b, c, d, e, f, and h to form an octagon.
00:44
And we have that a is connected to b, d, f, and h.
00:52
So we're skipping every other one.
01:01
Likewise, d is connected to c, e, g.
01:14
C is connected to d, f, and that's it.
01:27
D is connected to e.
01:38
E is connected to f and h...