On the Strong Chromatic Number and Vertex Strong Total Chromatic Number of Necklace
|更新时间:2026-09-14
|
On the Strong Chromatic Number and Vertex Strong Total Chromatic Number of Necklace
项链的强色数与点强全色数
Vol. 32, Issue 2, Pages: 119-122(2011)
作者机构:
1. 中北大学理学院
2. 太原师范学院数学系
作者简介:
基金信息:
DOI:
CLC:
Published:2011
稿件说明:
移动端阅览
田宝玉, 闫喜红. On the Strong Chromatic Number and Vertex Strong Total Chromatic Number of Necklace[J]. 2011, 32(2): 119-122.
DOI:
田宝玉, 闫喜红. On the Strong Chromatic Number and Vertex Strong Total Chromatic Number of Necklace[J]. 2011, 32(2): 119-122.DOI:
On the Strong Chromatic Number and Vertex Strong Total Chromatic Number of Necklace
摘要
研究了项链的强染色和点强全染色问题
得到了项链的强色数和点强全色数
提出了相应的染色方案
为图染色问题提供了一种全新的思路.
Abstract
Two kinds of coloring problem of necklace were mainly discussed
i.e.the strong coloring and the vertex strong total coloring.The strong chromatic number and the vertex strong total chromatic number of necklace were obtained.Meanwhile the corresponding coloring scheme was given.A new idea on coloring of graph was presented also.
关键词
Keywords
references
Liu Jingfa.On the strong coloring of some graphs[J].Mathematics in Economics,2004,21(1):78-82.
Wu Jianzhuan,Lin Wensong.The strong chromatic index of a class of graphs[J].Discrete Mathematics,2008,308(24):6254-6261.
Liu Linzhong,Zhang Zhongfu.On the vertex strong total coloring for Halin graphs withΔ(G)≤5[J].Mathematicsin Economics,2002,19(1):77-80.
刘景发,王振飞.Δ(G)≥6的Halin图的点强全染色[J].苏州科技学院学报(自然科学版),2003,20(4):18-20.Liu Jingfa,Wang Zhenfei.On the vertex strong total coloring of halin graphs withΔ(G)≥6[J].Journal ofUniversity of Science and Technology of Suzhou,2003,20(4):18-20.(in Chinese)
Stadler P F.Minimum cycle bases of Halin graphs[J].Graph Theory,2003,43:150-155.
Shiu W C,Lam P C B,Tam W K.On strong chromatic index of Halin graph[J].JCMCC,2005,55:124-132.