期刊文献+

完全二部图的广义Mycielski图的全染色与边染色 被引量:3

On The Total Coloring and The Edge Coloring of General Mycielski Graph M_l(K_(m,n))
原文传递
导出
摘要 为了找到Km,n图的广义Mycielski图的全色数与边色数,用分析的方法,考虑不同情况,给出了它的全染色法与边染色法,得到了它的全色数与边色数. In order to find the total chromatic number and the edge chromatic number of Mr(Km,n) graph. We use the methods of analysis, consisted of the different cases and gave the methods of total coloring and the edge coloring of M1(Km,n), obtained the total hromatic number and the edge chromatic number of M1(Km,n).
出处 《数学的实践与认识》 CSCD 北大核心 2007年第7期138-142,共5页 Mathematics in Practice and Theory
基金 国家自然科学基金(40301037) 甘肃省教育厅科研项目(0604-05)
关键词 完全二部图Km n 广义MYCIELSKI图 金染色 边染色 Km,n general Mycielski graph total coloring edge coloring
  • 相关文献

参考文献2

二级参考文献7

  • 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. 被引量:174
  • 2Chang, G. J., Huang, L. and Zhu, X., Circular chromatic number of Mycielskii's graphs, Discrete Math, 205(1999) ,23--37.
  • 3李敬文.若干图的广义Mycielski图的临强边色数,待发.
  • 4李敬文.若干图的Mycielski图的临强边色数,待发.
  • 5Zhang Zhongfu, Lui Linzhong, and Wang Jianfang, Adjacent strong edge coloring of graphs, Applied Mathematics Letter, 15(2002), 623--626.
  • 6Bondy, A and Murty, U. S. R. , Graph Theory with applications, The Macmillan press Ltd, 1976.
  • 7张忠辅,王建方.关于图的全着色——一个综述[J].数学进展,1992,21(4):390-397. 被引量:60

共引文献56

同被引文献8

引证文献3

二级引证文献15

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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