A new proof of Brooks's chromatic number theorem for graphs
Tài liệu tham khảo
Brooks, 1941, On Colouring the Nodes of a Network, Proc. Cambridge Philos. Soc., 37, 194, 10.1017/S030500410002168X
Gerencsér, 1965, On Coloring Problems, Mat. Lapok, 16, 274
Ore, 1967
Szekeres, 1968, An Inequality for the Chromatic Number of a Graph, J. Combinatorial Theory, 4, 1, 10.1016/S0021-9800(68)80081-X