期刊文献+

项链的强色数与点强全色数 被引量:1

On the Strong Chromatic Number and Vertex Strong Total Chromatic Number of Necklace
下载PDF
导出
摘要 研究了项链的强染色和点强全染色问题,得到了项链的强色数和点强全色数,提出了相应的染色方案,为图染色问题提供了一种全新的思路. Two kinds of coloring problem of necklace were mainly discussed,i.e.the strong coloring and the vertex strong total coloring.The strong chromatic number and the vertex strong total chromatic number of necklace were obtained.Meanwhile the corresponding coloring scheme was given.A new idea on coloring of graph was presented also.
出处 《中北大学学报(自然科学版)》 CAS 北大核心 2011年第2期119-122,共4页 Journal of North University of China(Natural Science Edition)
关键词 项链 强染色 点强全染色 强色数 点强全色数 necklace strong coloring vertex strong total coloring strong chromatic number vertex-strong total chromatic number
  • 相关文献

参考文献3

二级参考文献11

  • 1刘林忠,张忠辅.最大度不大于5的Halin-图的点强全染色(英文)[J].经济数学,2002,19(1):77-80. 被引量:10
  • 2刘林忠,谢继国,张忠辅.若干图的点强全染色(英文)[J].经济数学,1998,15(3):52-55. 被引量:7
  • 3[1]Harary,F. , Conditional colorability in graphs,in Graphs and Application,Proc. First Colorado Symp.Graph Theory,John Wiley & Sons Inc. ,New York, 1985.
  • 4[2]Favaron,Odile, Hao Li and R. H. Schelp, Strong edge coloring of graphs, Discrete Mathematics, 159(1996),103-109.
  • 5[3]Burns A. C. , Vertex-distinguishing Edge-coloring, Ph. D. Dissertation, Memphis State University,1993.
  • 6[4]Chartrand, Gary, Linda Lesniak-Foster, Graphs and Digraphs, ind. edition Wadsworth Brooks/Cole,Monterey,CA(1986).
  • 7[5]Nelson,Roy and Robin J. Wilson,Graph Colorings,Pitman Research Notes in Mathematic Series,218.
  • 8[6]Bondy,J. A. and Murty,U. S. R. ,Graph theory applications,The Macmillan Press Ltd. , 1976.
  • 9[7]Halin,R. ,Stuties on minimal n-connected graph,Comb. Math. and Its Applications,Proc. conf. Oxford,1969.
  • 10[8]Zhang Zhongfu,Liu Linzhong,A note on the total chromatics Number of Halin-graph with △(G)≥4,Appl. Math. Lett , 11:5(1998) ,23-27.

共引文献9

同被引文献5

  • 1张忠辅,陈祥恩,李敬文,姚兵,吕新忠,王建方.关于图的邻点可区别全染色[J].中国科学(A辑),2004,34(5):574-583. 被引量:192
  • 2Zhang Z F,Douglas R W,Li J. Incidence adjacent vertexdistinguishing total coloring of graphs[R].Lanzhou:Lanzhou Jiaotong University,2008.1-8.
  • 3Bondy J A,Murty U S R. Graph theory with applications[M].New York:The Macmillan Press Ltd,1976.
  • 4Stadler P F. Minimum cycle bases of Halin graphs[J].Graph Theory,2003,(2):150-155.doi:10.1002/jgt.10111.
  • 5Zhang Z,Qiu P,Xu B. Vertex-distinguishing total coloring of graphs[J].ARS Combinatoria,2008.33-45.

引证文献1

二级引证文献3

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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