期刊文献+

简单图mC_4的点可区别V-全染色

Vertex-distinguishing V- total chromatic number of simple graph mC_4
下载PDF
导出
摘要 根据简单图的点可区别V-全染色的概念及其染色方法,讨论m个阶为4的圈的顶点不交并的点可区别V-全染色,并给出全色数及其证明.为进一步探讨其他简单图的点可区别V-全染色提供了理论证据,丰富了图的点可区别V-全染色的结果. According to the definition and the method of the vertex-distinguishing V- total coloring,mainly discussed the vertex-distinguishing V- total coloring of the vertex-disjoint union of mC4,and gave vertex- distinguishing V-total chromatic number,which provided a theoretical evidence for the prospective studies of other simple graph vertex-distinguishing V- total coloring and enriched results of the graph vertex-distinguishing V-total coloring.
出处 《高师理科学刊》 2016年第8期1-6,共6页 Journal of Science of Teachers'College and University
基金 国家自然科学基金天元基金资助项目([2013]-11326206) 2014年度河南科技学院教育教学改革研究项目(教师教育[2014]37号) 河南省教育厅2013年度教师教育课程改革研究项目(2013-JSJYYB-099)
关键词 简单图 全色数 点可区别V-全染色 simple graph chromatic number vertex-distinguishing V-total coloring
  • 相关文献

参考文献7

二级参考文献30

  • 1ZHANG Zhongfu, CHEN Xiang’en, LI Jingwen, YAO Bing, LU Xinzhong & WANG Jianfang College of Mathematics and Information Science, Northwest Normal University, Lanzhou 730070, China,Department of Computer, Lanzhou Normal College, Lanzhou 730070, China,Institute of Applied Mathematics, Lanzhou Jiaotong University, Lanzhou 730070, China,College of Information and Electrical Engineering, Lanzhou Jiaotong University, Lanzhou 730070, China,Institute of Applied Mathematics, Chinese Academy of Sciences, Beijing 100080, China.On adjacent-vertex-distinguishing total coloring of graphs[J].Science China Mathematics,2005,48(3):289-299. 被引量:173
  • 2ZHANG ZhongFu,CHENG Hui,YAO Bing,LI JingWen,CHEN XiangEn,XU BaoGen.On the adjacent-vertex-strongly-distinguishing total coloring of graphs[J].Science China Mathematics,2008,51(3):427-436. 被引量:78
  • 3张忠辅,陈祥恩,李敬文,姚兵,吕新忠,王建方.关于图的邻点可区别全染色[J].中国科学(A辑),2004,34(5):574-583. 被引量:192
  • 4陈祥恩.n-方体的点可区别全色数的渐近性态[J].西北师范大学学报(自然科学版),2005,41(5):1-3. 被引量:16
  • 5BONDY J A, MURTY U S R. Graph theory[M]. London: Springer, 2008.
  • 6JENSEN T R, TOFT B. Graph coloring problems[M]. New York: Wiley, 1995.
  • 7ALON N, MOHAR B. The chromatic number of graph powers [J]. Combinatorics, Probability and Computing, 2002, 11 : 1-10.
  • 8AGNARSSON G, HALLDORSSON M M. Coloring powers of planar graphs [J]. SIAM J Discrete Mathmatics, 2003, 16 (4) :651-662.
  • 9BORODIN O V, BROERSMA H J, GLEBOV A, et al. Stars and bunches in planar graphs : Part Ⅰ. triangulations CDAM research report series [J].Original Russian Version. Diskretn Anal Lssled Oper Ser, 2001, 18 (2) :15-39.
  • 10BORODIN O V, BROERSMA H J, GLEBOV A, et al. Stars and bunches in planar graphs: Part Ⅱ: general planar graphs and coloring CDAM research report series[J]. Original Russian Version. Diskretn Anal Lssled Oper Ser 2001, 18(4) :9-33.

共引文献353

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部