平面规则网格的一个全染色方案  

Total coloring scheme of regular planar meshes

作　　者：温宇鹏[1] 田宝玉[1] 王科伦[1] 高志军[1] 

机构地区：[1]大连海事大学数学系,辽宁大连116026

出　　处：《大连海事大学学报》2006年第4期116-120,共5页Journal of Dalian Maritime University

摘　　要：方形网格、六角网格、蜂巢网格是三类平面规则网格.根据平面规则网格的特点,研究了这三类网格上的全染色问题,给出了全色数为最大顶点度加1的全染色最优方案。Square meshes, hexagonal meshes and honeycomb meshes are three regular planar meshes. Based on the character of the regular planar meshes, we give an optimum total coloring method which made the three kinds of meshes have the smallest total chromatic number. And we get the total chromatic number of square meshes, honeycomb meshes and hexagonal meshes is equal to the maximum degree of the meshes plus 1, respectively.

关 键 词：图论 平面规则网格 全染色 全色数 

分 类 号：O157.5[理学—数学]