点击下载:南京大学:《计算机问题求解》课程教学资源(课件讲稿)平面图与图着色
正在加载图片...
Theorem 10.8 (Brooks'Theorem) For every connected graph G that is not an odd cycle or a complete graph, -X(G)<=△(G).Theorem 10.8 (Brooks’ Theorem) • For every connected graph G that is not an odd cycle or a complete graph, – Χ(G) <= Δ(G)
<<向上翻页
点击下载:南京大学:《计算机问题求解》课程教学资源(课件讲稿)平面图与图着色
©2008-现在 cucdc.com 高等教育资讯网 版权所有