| 网格图的剖分图的强边染色 |
| |
| 引用本文： | 黄会芸. 网格图的剖分图的强边染色[J]. 吉首大学学报(自然科学版), 2012, 33(5): 12-15. DOI: 10.3969/j.issn.1007-2985.2012.05.003 |
| |
| 作者姓名： | 黄会芸 |
| |
| 作者单位： | （南京化工职业技术学院，江苏 南京 210048） |
| |
| 摘 要： | 研究了3种网格图的剖分图的强边着色.网格图的剖分图是指用一个长为2的路去替换网格图的每条边.具体给出了六边形、四边形、三角形的网格剖分图的一种着色方法，以此为基础证明了Sχ′(Γs6)=4，Sχ′(Γs4)=5，Sχ′(Γs3)=7.
|
| 关 键 词： | 染色 强边染色 强边色数 网格图 剖分图 |
Strong Edge Coloring of the Subdivision Graph of Lattices Graphs |
| |
| HUANG Hui-yun. Strong Edge Coloring of the Subdivision Graph of Lattices Graphs[J]. Journal of Jishou University(Natural Science Edition), 2012, 33(5): 12-15. DOI: 10.3969/j.issn.1007-2985.2012.05.003 |
| |
| Authors: | HUANG Hui-yun |
| |
| Affiliation: | (Nanjing College of Chemical Technology,Nanjing 210048,China) |
| |
| Abstract: | The strong edge coloring of the subdivision graph of three kinds of lattices graphs is discussed.The subdivision graph of one lattice graph is achieved by replacing every edge of the lattice graph with one route which has a distance of two.This paper introduces one method of coloring for the subdivision graph of hexagonal lattice graph,quadrangular lattice graph and trigngular net graph,and then proves that Sχ′(Γs6)=4,Sχ′(Γs4)=5,Sχ′(Γs3)=7. |
| |
| Keywords: | coloring strong edge coloring strong edge chromatic number lattice graph subdivision graph |
| 本文献已被 CNKI 等数据库收录！ |
| 点击此处可从《吉首大学学报(自然科学版)》浏览原始摘要信息 |
|
点击此处可从《吉首大学学报(自然科学版)》下载全文 |
