期刊文献+

几种特殊图的均匀边染色

Equitable Edge-Coloring of Some Special Graphs
下载PDF
导出
摘要 研究立方Halin图以及一些倍图的均匀边染色,利用换色法、构造法和归纳法得出:立方Halin图和路的倍图都是均匀的,星的倍图都有均匀4边染色. The equitable, edge-coloring of cubic Halin graphs and some double graphs are studied by using induction, interchange colors method and construction. The results indicate that cubic Halin graphs and the double graphs of path are equitable, and the double graphs of star have an equitable edge-coloring with 4 colors.
出处 《五邑大学学报(自然科学版)》 CAS 2012年第4期6-8,共3页 Journal of Wuyi University(Natural Science Edition)
基金 国家自然科学基金资助项目(No.11001265) 中央高校基本科研业务费专项基金资助项目(2010LKSX06)
关键词 立方Halin图 倍图 均匀边染色 cubic Halin graph double graph equitable edge-coloring
  • 相关文献

参考文献3

  • 1BONDY J A, MURTY U S R. Graph theory with application[M]. London: Macmillan Press, 1976: 1-200.
  • 2张忠辅,仇鹏翔,张东翰,卞量,李敬文,张婷.图的倍图与补倍图(英文)[J].数学进展,2008,37(3):303-310. 被引量:22
  • 3HILTON A J W, WERRA de D. A sufficient condition for equitable edge-colourings of simple graphs[J]. Discrete Mathematics, 1994, 128: 179-201.

二级参考文献14

  • 1[1]Bondy,J.A.,Murty,U.S.R.,Graph Theory With Application.New York:The Macmillan Press Ltd,1976.
  • 2[2]Tian Feng,Ma Zhongfan,The Theory of Graphs and Networks,The Press of Science,1987.
  • 3[3]Marek Kubale,Graph Coloring,American Mathematical Society Providence,Rhode Island,2004.
  • 4[4]Kostochka,A.V.,The total coloring of a multigraph with maximal degree 4,Discrete Mathematics,1977,17:161-163.
  • 5[5]Sanchez-Arroyo,A.,Determining the total colouring number is NP-haxd,Discrete Mathematics,1989,78:315-319.
  • 6[6]Yap,H.P.,Total colourings of graphs,Lecture Notes in Mathematics,vol.1623,Springer,Berlin,1996.
  • 7[7]Zhang Zhongfu,Zhang Jianxun,Wang Jianfang,The total chromatic number of some graph,Sci.Sinica Set.A,1988,31(12):1434-1441.
  • 8[8]Zhang Zhongfu,Wang Jianfang,A summary of the progress on total colorings of graphs,Adv.in math.(China),1992,21:390-397.
  • 9[9]Zhang Zhongfu,Liu Linzhong,Wang Jianfang,Adjacent strong edge coloring of graphs,Applied Mathematics Letters,2002,15:623-626.
  • 10[10]Hamed Hatami,A+300 is a bound on the adjacent vertex distinguishing edge chromatic number,Journal of Combinatorial Theory,Series B,2005,95:246-256.

共引文献21

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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