journal6 ›› 2012, Vol. 33 ›› Issue (5): 12-15.DOI: 10.3969/j.issn.1007-2985.2012.05.003
• 数学 • 上一篇 下一篇
出版日期:
发布日期:
作者简介:
Online:
Published:
摘要：研究了3种网格图的剖分图的强边着色.网格图的剖分图是指用一个长为2的路去替换网格图的每条边.具体给出了六边形、四边形、三角形的网格剖分图的一种着色方法，以此为基础证明了Sχ′(Γs6)=4，Sχ′(Γs4)=5，Sχ′(Γs3)=7.
关键词： 染色, 强边染色, 强边色数, 网格图, 剖分图
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.
Key words: coloring, strong edge coloring, strong edge chromatic number, lattice graph, subdivision graph
黄会芸. 网格图的剖分图的强边染色[J]. journal6, 2012, 33(5): 12-15.
HUANG Hui-Yun. Strong Edge Coloring of the Subdivision Graph of Lattices Graphs[J]. journal6, 2012, 33(5): 12-15.
0 / / 推荐
导出引用管理器 EndNote|Ris|BibTeX
链接本文: https://zkxb.jsu.edu.cn/CN/10.3969/j.issn.1007-2985.2012.05.003
https://zkxb.jsu.edu.cn/CN/Y2012/V33/I5/12
