期刊文献+

六角系统关联色数与邻点可区别关联色数 被引量:5

Incidence chromatic number and adjacent vertex-distinguishing incidence chromatic number of hexagonal systems
下载PDF
导出
摘要 通过运用嵌入法,得到了平面中任意六角系统以及六角系统的r-冠图的关联色数和邻点可区别关联色数。 The incidence chromatic number and adjacent vertex-distinguish incidence chromatic number of free hexagonal systems and r-corona graph in the plane were obtained by using the embedding method of graphs.
出处 《山东大学学报(理学版)》 CAS CSCD 北大核心 2008年第9期57-62,共6页 Journal of Shandong University(Natural Science)
关键词 六角系统 关联色数 邻点可区别关联色数 r-冠图 hexagonal systems incidence chromatic number adjacent vertex-distinguishing incidence chromatic number r-corona graph
  • 相关文献

参考文献4

  • 1BRUALDI R A, QUINN MASSEY J J. Incidence and strong edge colorings of graphs[J]. Discrete Math, 1993, 122:51-58.
  • 2费本初,李鸿祥.六角系统的色数问题[J].上海铁道学院学报,1995,16(2):55-58. 被引量:1
  • 3BONDY J A, MURTY U S R. Graph theory with application[M]. New York: Macmillan Press LTD, 1976.
  • 4刘西奎,王雅琴.几类冠图的邻强边色数[J].山东科技大学学报(自然科学版),2006,25(4):101-103. 被引量:10

二级参考文献13

共引文献9

同被引文献39

  • 1闫立军,王淑栋,马芳芳.系列平行图和Meredith图的关联着色[J].高校应用数学学报(A辑),2008,23(4):481-486. 被引量:3
  • 2陈东灵,刘西奎,王淑栋.图的关联色数和关联着色猜想[J].经济数学,1998,15(3):47-51. 被引量:29
  • 3马刚,马明,张忠辅.皇冠图G_(n,m)的邻点可区别边色数[J].华东交通大学学报,2005,22(2):141-143. 被引量:6
  • 4Brualdi R A,Quinn Massey J J.Incidence and strong edge colorings of graphs[J].Discrete Math,1993,122:51-58.
  • 5Guiduli B.On incidence coloring and star arboricity of graphs[J].Discrete Mathematics,1997,163:275-278.
  • 6Algor I,Alon N.The star arboricity of graphs[J].Discrete Mathematics,1989,75:11-22.
  • 7Wang Shu-dong,Chen Dong-ling,Pang Shan-chen.The incidence coloring number of Halin graphs and outerplanar graphs[J].Discrete Mathematics,2002,256:397-405.
  • 8Mohammad H D,Sopena E,Zhu Xu-ding.Incidence coloring of k-degenerated graphs[J].Discrete Mathematics,2004,283:121-128.
  • 9Huang Cheng-i,Wang Yue-li,Chung S S.The incidence coloring numbers of meshes[J].Computers and Mathematics with Applications,2004,48:1 643-1 649.
  • 10Maksim M.The incidence coloring conjecture for graphs of maximum degree 3[J].Discrete Mathematics,2005,292:131-141.

引证文献5

二级引证文献4

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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