若干类3-正则图的Smarandachely邻点全染色的界  

The Bound of the Smarandachely Adjacent Vertex Total Coloring of Some Kinds of 3-regular Graph

作　　者：李沐春[1] 王立丽[1] 张伟东[1] 凌昭昭 

机构地区：[1]兰州交通大学数理学院,甘肃兰州730070

出　　处：《南开大学学报（自然科学版）》2014年第6期79-84,共6页Acta Scientiarum Naturalium Universitatis Nankaiensis

基　　金：国家自然科学基金(11061017);甘肃省自然科学基金(甘01212RJZA039);甘肃省硕导基金项目(1104-10)

摘　　要：针对3-正则图的结构性质,利用组合分析法和构造染色的方法讨论了若干类3-正则图的Smarandachely邻点全染色,并得到了其Smarandachely邻点全色数,进一步验证了图的Smarandachely邻点全染色猜想.According to the the structure of 3-regular graph,using the methods of combinatorial analysis and constructing concrete coloring,the Smarandachely adjacent vertex total coloring of some kinds of 3-regular graph is discussed and the Smarandachely adjacent vertex total chromatic number of some kinds of 3-regular graph are abtained.The Smarandachely adjacent vertex total coloring conjecture is further validated.

关 键 词：3-正则图 Smarandachely邻点全染色 Smarandachely邻点全色数 

分 类 号：O157.5[理学—数学]