共查询到20条相似文献,搜索用时 15 毫秒
1.
2.
4.
5.
6.
Brooks’ theorem is a fundamental result in the theory of graph coloring. Catlin proved the following strengthening of Brooks’ theorem: Let d be an integer at least 3, and let G be a graph with maximum degree d. If G does not contain Kd+1 as a subgraph, then G has a d-coloring in which one color class has size α(G). Here α(G) denotes the independence number of G. We give a unified proof of Brooks’ theorem and Catlin’s theorem. 相似文献
7.
8.
9.
10.
11.
12.
13.
14.
15.
16.
18.
19.