摘要
通过构造一个可行算法——条件图算法,给出了一般图的条件边集合,并由此得到条件图,对条件图应用正常着色已有性质,证明了两个条件着色色数上界表达式.
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.
出处
《琼州学院学报》
2010年第2期8-9,13,共3页
Journal of Qiongzhou University
关键词
条件着色
条件图算法
条件图
MOORE图
conditional coloring
graph of condition algorithm
conditional graph
moore graph
