Sequential coloring versus Welsh-Powell bound
暂无分享,去创建一个
We comment in this note on the relations between sequential coloring and the Welsh-Powell upper bound for the chromatic number of a graph.
[1] D. J. A. Welsh,et al. An upper bound for the chromatic number of a graph and its application to timetabling problems , 1967, Comput. J..