期刊文献+

完全图的点可区别V-全染色 被引量:3

Vertex distinguishing V-total coloring of complete graphs
下载PDF
导出
摘要 根据图的点可区别全染色的概念及其染色方法,讨论了图的点可区别V-全染色,给出了完全图Kn的点可区别V-全色数的结论及其证明,为进一步探讨其他简单图的点可区别V-全染色提供了理论证据,丰富了图的点可区别V-全染色的结果. According to the definition and the method of the vertex-distinguishing total coloring,the vertex-distinguishing V-total coloring of gragh is discussed,and the conclusion and proof of the vertex-distinguishing V-total chromatic number of complete graph Kn are given.To further explore other simple graph vertex-distinguishing V-total coloring provides a theoretical evidence that enriched the graph vertex-distinguishing V-total coloring results.
作者 马宝林
机构地区 河南科技学院
出处 《河南科技学院学报(自然科学版)》 2011年第5期44-46,50,共4页 Journal of Henan Institute of Science and Technology(Natural Science Edition)
关键词 简单图 点可区别V-全染色 点可区别V-全色数 完全图 simple graph Vertex-distinguishing V-total coloring Vertex-distinguishing V-total chromatic number complete graph
  • 相关文献

参考文献5

二级参考文献26

  • 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
  • 2BONDY J A, MURTY U S R. Graph theory[M]. London: Springer, 2008.
  • 3JENSEN T R, TOFT B. Graph coloring problems[M]. New York: Wiley, 1995.
  • 4ALON N, MOHAR B. The chromatic number of graph powers [J]. Combinatorics, Probability and Computing, 2002, 11 : 1-10.
  • 5AGNARSSON G, HALLDORSSON M M. Coloring powers of planar graphs [J]. SIAM J Discrete Mathmatics, 2003, 16 (4) :651-662.
  • 6BORODIN 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.
  • 7BORODIN 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.
  • 8MOLLOY M, SALAVATIPOUR M R. A bound on the chromatic number of the square of a planar graph[ J]. Journal of Combinatorial Theory: Series B, 2005, 94(2) :189-213.
  • 9LIH K W, WANG W F. Coloring the square of an outerplanar graph[ J]. Taiwan Residents Journal of Mathematics, 2006, 10(4) : 1015-1023.
  • 10FERTIN G, GODARD E, RASPAUD Andre. Acyclic and k-distance coloring of the grid[ J]. Information Processing Letters, 2003, 87:51-58.

共引文献382

同被引文献11

  • 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
  • 5Zhang Z F,Chen X E.On adjaoent-vertex-distinguishing total coloring of graphs[J].Soienee in China (Ser A ),2005,48 ( 3 ):289-299.
  • 6马宝林,刘娟,陈祥恩.图mP2与mP,的点可区别E-全染色[J].读写算,2010(9):201-202.
  • 7Zheng Z F,Qiu P X,Xu B G,et a/.Vertex-distinguishing total colorings of graphs[J].Ars Combinatoria,2008(87): 33-45.
  • 8马宝林,刘娟,陈祥恩.图畔与mP3的点可区别E一全染色[J].读写算,2010(9):201-202.
  • 9ZHANG ZH F, QIU P X, XU B G, et al, Vertex-distinguishing total colorings of graphs[J]. Ars Combinatoria, 2008 ( 87 ) 33-45.
  • 10马宝林,陈祥恩,刘娟.图的强直积的2-距离染色(英文)[J].山东大学学报(理学版),2010,45(3):66-70. 被引量:4

引证文献3

二级引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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