This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: vertices in H containing v1. The result of this recoloring is v1 and v3 will both be green so v can be colored red. v1 red v2 blue v5 v3 green purple v v4 yellow 2) If v1 and v3 lie in the same component of H then there is a circuit of the form v -> v1 -> … -> v3 -> v with alternating colors red and green. Notice that v2 lies entirely in the circuit and v4 lies outside, so there cannot be any two-color path between v2 and v4 lying entirely in H(blue, yellow) – the graph is planar and such a path would cross an edge of the circuit. We can therefore interchange the colors of the vertices in the component of H(blue, yellow) containing v2. Then, vertex v2 and v4 would both be colored yellow enabling v to be colored blue. This completes the proof....
View Full Document
- Winter '08
- Planar graph, vertices, recoloring