Graph Theory图论.pptVIP

  • 29
  • 0
  • 约5.22千字
  • 约 26页
  • 2017-03-07 发布于上海
  • 举报
Graph Theory图论

* Are the graphs G and H homeomorphic? * H G * Example 7.30 The Petersen graph is nonplanar. (a) Petersen Thm 7.26: (Kuratowski’s Theorem) A graph G is planar, if and only if, it has no subgraph homeomorphic to either K5 or K3,3. (b) Subdivision of K3,3 3 2 1 6 5 4 1 2 3 4 5 6 7 8 9 10 Show that the following graph is nonplanar. * Chapter 7 Planar Graphs 大葉大學 資訊工程系 黃鈴玲 2011.12 7.2 Planar Embeddings 7.3 Euler’s Formula and Consequences 7.4 Characterization of Planar Graphs * (1) circuit layout problems (2) Three house and three utilities(水電瓦斯) problem A graph that can be drawn in the pla

文档评论(0)

1亿VIP精品文档

相关文档