期刊文献+

完全立方Halin图的2-距离着色 被引量:1

2-Distance Coloring of Complete Cubic Halin Graphs
下载PDF
导出
摘要 图G的2-距离着色是正常的顶点着色,并且使G中距离不大于2的任意两个顶点着不同的颜色.图G的2-距离色数是图G的所有2-距离着色中所用色数的最小者,记为χ2d(G).探讨了完全立方Halin图Hn的2-距离着色,并得χ2d(H0)=4,5≤χ2d(Hn)≤6(n≥1). The 2 - distance coloring of a graph G is a proper coloring such that no two vertices at distance less than or equal to 2 in Gare assigned the same color. The 2 - distance chromatic number of a graph G, denoted by X2d ≤(G) , is the smallest integer k for which G admits a star coloring with k colors. In this paper, we show that if Hn is a complete cubic Halin graph, then 5 ≤X2d ( Hn )≤6 ( n≥1 ).
出处 《重庆工商大学学报(自然科学版)》 2010年第2期108-110,113,共4页 Journal of Chongqing Technology and Business University:Natural Science Edition
基金 重庆市科委自然科学基金计划项目资助(CSTC 2007BB2123)
关键词 完全立方Halin图 2-距离着色 2-距离色数 complete cubic Halin graphs 2 -distance coloring 2 -distance chromatic number
  • 相关文献

参考文献7

二级参考文献14

  • 1BONDY J A, MURTY U S R . Graph Theory with Applications [ M ]. New York:The Macmillan Press Ltd, 1976.
  • 2WEST D B. Introduction to Grapy Theory (2nd ed) [ M]. Prentice-Hall, Englewood Cliffs, NJ, 2001.
  • 3ANDERSEN L D. The strong chromatic index of a cubic graph is at most 10, Topological, algebraical and combinatorial structures. Frolik's emporia volume[ J]. Discrete Math, 1992,108 (1-3) :231-252.
  • 4CRANSTON D W. Strong edge-coloring of graphs with maximum degree 4 [ J]. Discrete Math,2006,306:2772-2778.
  • 5[1]Gary Chartrand,Linda Lesniak Foster.Graphs and Digraphs[M].Monterey:Wadsworth Books/Cole,1986.1-150.
  • 6[2]Roy Nelson,Robin J Wilson.Graph Colorings[M].London:Pitman Research Notes in Mathematic Series,1990.218.
  • 7[3]Harary F.Conditional colorability in graphs[A].Graphs and Applications.Proc.First Colorado Symp.Graph Theory[C].New York:John Wiley & Sons Inc,1985.1-200.
  • 8Chen B L,Graphs and Combinatorics,1992年,8卷,119页
  • 9Bondy J A, Murty U S R. Graph Theory with Applications [M]. London: The Macmillan Press Ltd, 1976. 10- 100.
  • 10Jackson B. Hamilton Cycles in Regular 2-connected Graphs [J]. J Combin Theory Ser B, 1980, 29:27 -46.

共引文献20

同被引文献8

  • 1李鸿祥,张忠铺,张建勋.Halin图的色性[J].上海铁道学院学报,1994,15(1):19-24. 被引量:13
  • 2刘林忠,李引珍,张忠辅.On the Vertex Strong Total Coloring of Halin-Graphs[J].Journal of Mathematical Research and Exposition,2006,26(2):269-275. 被引量:2
  • 3Bondy J A,Murty U S R.Grpah Theory with Application[M].London:Macmillan Press,1976:2-11.
  • 4Gary C,Futaba O,Craig W R,et al.The Set Hromatic Number of a Graph[J].Discussiones Mathematicae Graph Theory,2009(3):545-561.
  • 5Shu W C,Tam W K.The Strong Chromatic Index of Complete Cubic Halin Graphs[J].Applied Mathematics letters,2009(5):754-758.
  • 6Zhang Zhong-fu,Liu Xin-zhong.On the Complete Chromatic Number of Halin Graphs[J].Acata Math Appl Sinica,1990(13):102-106.
  • 7石少俭,张雪峰,王效义.轮图的列表染色[J].山东工程学院学报,2001,15(4):28-29. 被引量:1
  • 8肖立,娄定俊.Halin图的点着色算法[J].Journal of Mathematical Research and Exposition,2003,23(3):535-540. 被引量:3

引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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