Basic Graph Theory - 國立臺灣大學

Theorem. A graph G is planar iff no subgraph of G is homeomorphic to K5 or K3,3. Proof. Refer to : N. Deo, Graph Theory with Applications to Engineering and Computer Science, 1974, or F. Harary, Graph Theory, 1972. ( Matching. M ( E is a matching in G = (V, E) … ................
................