ON n-TOTAL CHROMATIC NUMBER OF A GRAPH AND ITS COMPLEMENT GRAPH  

作　　者：张忠辅 孙良 

机构地区：[1]Lanzhou Railway Institute, Lanzhou 730070, PRC [2]Beijing Institute of Technology, Beijing 100081, PRC

出　　处：《Chinese Science Bulletin》1991年第13期1134-1134,共1页

基　　金：Project supported by the National Natural Science Foundation of China and Natural Science Fund of Gansu Province, China.

摘　　要：Let G(V, E) be a simple graph, f: C→V(G) be an injection, and all vertices on the path whose length is no longer than n be assigned different colors, where C is a color set. Then f is called an n-coloring of G. If |C|=m, f is called m-n-coloring graph, G m-n-colorable if there exists a k-n-coloring of G for some k≤m.

关 键 词：COLORING COLORS CHROMATIC VERTEX assigned LENGTH longer 

分 类 号：N[自然科学总论]