r,s,t-Coloring of the Joint Graph Cm νCn

摘要：

The coloring of graph has been an important and active branch in graph theory.r,s,t -coloring is a generalization of the classical vertex coloring,edge coloring and total coloring of a graph,which has significant applications in the training arrangement of some tournament and the frequency channel assignment and so on.This paper give a study of the r,s,t -coloring and the r,s,t -chromatic number of the joint graph Cm νCn  in certain conditions.

作者: PAN Yumei MO Mingzhong

作者单位: Department of Mathematics and Computer Science,Liuzhou Teachers College,Guangxi 54500 4,P.R.China

会议类型: 国际会议

会议名称: The 30th Chinese Control Conference(第三十届中国控制会议)

会议地点: 烟台

会议语种:英文

页码: 1-5

在线出版日期: 2011-07-01（万方平台首次上网日期，不代表论文的发表时间）