中北大学学报（自然科学版）2011，Vol.32Issue(2)：119-122,4.DOI:10.3969/j.issn.1673-3193.2011.02.001
项链的强色数与点强全色数
On the Strong Chromatic Number and Vertex Strong Total Chromatic Number of Necklace
田宝玉 1闫喜红2
作者信息
- 1. 中北大学理学院,山西,太原,030051
- 2. 太原师范学院数学系,山西,太原,030012
- 折叠
摘要
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.关键词
项链/强染色/点强全染色/强色数/点强全色数Key words
necklace/ strong coloring/ vertex strong total coloring/ strong chromatic number/ vertexstrong total chromatic number分类
数理科学引用本文复制引用
田宝玉,闫喜红..项链的强色数与点强全色数[J].中北大学学报（自然科学版）,2011,32(2):119-122,4.
