期刊文献+

三角金字塔网的点、边、全色数

Vertex-,edge-,and total-colorings of triangular pyramid networks
下载PDF
导出
摘要 确定了三角金字塔网TP L的点色数χ(TP L)=4,当L≥4时,它的边色数为χ'(TP L)=12,它的全色数为χ'T(TP L)=13.所得结果进一步完善了三角金字塔网TP L的知识体系. Some colorings of the triangular TPL was showed X( TPL) =4. When L≥4, tal-chromatic number of TPL was X'τ( TPL ) pyramid network TPL further. pyramid network TPL were determined. The chromatic number of the edge-chromatic number of TPL was X' ( TPL) = 12 and the to- = 13. The results improved the knowledge system of the triangular
作者 喻雪荣
出处 《浙江师范大学学报(自然科学版)》 CAS 2013年第4期414-416,共3页 Journal of Zhejiang Normal University:Natural Sciences
基金 国家自然科学基金资助项目(11101378)
关键词 三角金字塔网 点色数 边色数 全色数 triangular pyramid network chromatic number edge chromatic number total chromatic number
  • 相关文献

参考文献7

  • 1Jakovac M,Klav(z)ar S. Vertex-,edge-,and total-colorings of Sierpinski-like graphs[J].{H}DISCRETE MATHEMATICS,2009,(06):1548-1556.
  • 2Chen Meirun,Guo Xiaofeng. Adjacent vertex-distinguishing edge and total chromatic numbers of hypercubes[J].{H}Information Processing Letters,2009,(12):599-602.doi:10.1016/j.ipl.2009.02.006.
  • 3Liu Bin,Hou Jianfeng,Wu Jianliang. Total colorings and list total colorings of planar graphs without intersecting 4-cycles[J].{H}DISCRETE MATHEMATICS,2009,(20):6035-6043.
  • 4薛玲,吴建良.较少短圈的平面图的全色数[J].山东大学学报(理学版),2012,47(9):84-87. 被引量:1
  • 5王侃.最大度为6的平面图是13-线性可染的[J].浙江师范大学学报(自然科学版),2012,35(2):121-124. 被引量:1
  • 6傅彩霞.若干倍图的均匀染色[J].浙江师范大学学报(自然科学版),2012,35(2):133-137. 被引量:2
  • 7Razavi S,Sarbazi-Azad H. The triangular pyramid:routing and topological properties[J].{H}Information Sciences,2010,(11):2328-2339.

二级参考文献32

  • 1孙向勇.不含四圈,三圈不重点的平面图全染色的一个结论[J].山东大学学报(工学版),2007,37(3):118-121. 被引量:1
  • 2Yuster R. Linear coloring of graphs [ J ]. Discrete Math, 1998,185 ( 1/2/3 ) :293 -297.
  • 3Grtinhaum B. Aeyclie colorings of planar graphs [ J ]. Israel J Math, 1973,14 (4) : 390~08.
  • 4Borodin O V. On acyclic colorings of planar graphs [ J]. Discrete Math, 1979,25 (3) :211-236.
  • 5Kostochka A V. Acyclic 6-coloring of planar graphs[ J ]. Metody Diskret Anal, 1976,28:40-56.
  • 6Wang Weifan, Shu Qiaojun, Wang Kan, et al. Acyclic chromatic indices of planar graphs with large girth [ J ]. Discrete Appl Math,201 I, 159 (12) : 1239-1253.
  • 7Esperet L, Montassier M, Raspaud A. Linear choosability of graphs[ J 1. Discrete Math ,2008,308 ( 17 ) :3938-3950.
  • 8Raspaud A, Wang Weifan. Linear coloring of planar graphs with large girth [ J ]. Discrete Math,2009,309 ( 18 ) :5678-5686.
  • 9Li Chao, Wang Weifan, Raspaud A. Upper bounds on the linear chromatic number of graph [ J ]. Discrete Math ,2011,311 ( 4 ) :232-238.
  • 10I Erdtis P. Extremal problems in graph theory[ C ]//Miroslav F. Theory of graphs and its applications. NewYork:Prague Pub, 1964:29-36.

共引文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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