Two New Upper Bounds of Conditional Coloring in Graphs
Zhehe Wang · Journal of Qiongzhou University · 2010
Finding a conditional graph of simple graphs through a feasible algorithm,discuss the relationship between the chromatic number of conditional graph and the chromatic number of original graph,and then get two upper bounds of conditional coloring.