Unformatted text preview: produce a floor plan. 1 2 1 2 7 <P~4 7 8 8 21. (a) By Kuratowski's Theorem, the graph here is not planar: It contains K 3,3 as a subgraph, with bipartition sets {A, B, F} and {C, D, E}. (b) Call the graph 9. ACBEGFDA is a Hamiltonian cycle. On the left, we show these vertices in order on a circle and draw 9 again. Call the new graph 91. Next, we label the interior edges, a, b, e, d, e, and f, and draw a graph 1i (on the right) whose vertices correspond to a, ... , f....
View
Full Document
 Summer '10
 any
 Graph Theory, Planar graph, Glossary of graph theory, Graph coloring, Four color theorem

Click to edit the document details