| 阿基米德图的面唯一极大染色 |
| |
| 引用本文： | 张悦,徐常青.阿基米德图的面唯一极大染色[J].数学进展,2020(2):159-164. |
| |
| 作者姓名： | 张悦 徐常青 |
| |
| 作者单位： | 河北工业大学理学院 |
| |
| 基金项目： | 国家自然科学基金(No.11671232)。 |
| |
| 摘 要： | 给定平面图G的一个正常κ-顶点染色φ:V(G)→{1,2,…,κ},若对G的每个面f,与f关联的顶点所染颜色的极大颜色在与f关联的顶点中仅出现一次,则称φ是图G的面唯一极大κ-染色.图G存在面唯一极大κ-染色的κ的最小值称为G的面唯一极大色数,记作χfum(G).本文研究了阿基米德图的面唯一极大色数,证得若图G是阿基米德图,则χfum(G)=4.
|
| 关 键 词： | 面唯一极大染色 面唯一极大色数 阿基米德图 |
Facial Unique-maximal Coloring of Archimedean Graphs |
| |
| ZHANG Yue,XU Changqing.Facial Unique-maximal Coloring of Archimedean Graphs[J].Advances in Mathematics,2020(2):159-164. |
| |
| Authors: | ZHANG Yue XU Changqing |
| |
| Institution: | (School of Science,Hebei University of Technology,Tianjin,30040l,P.R.China) |
| |
| Abstract: | Given a proper κ-vertex coloring φ:V(G) →{1,2,…,κ} of graph G,φis called a facial unique-maximal κ-coloring if for each face f of G,the maximal color of the vertices incident with f occurs exactly once on the vertices of f.The smallest κ such that G has a facial unique-maximal κ-coloring is called the facial unique-maximal chromatic number of G,denoted by In this paper,we study the facial unique-maximal chromatic number of Archimedean graphs,and get that if G is an Archimedean graph,then χfum(G)=4. |
| |
| Keywords: | facial unique-maximal coloring facial unique-maximal chromatic number Archimedean graphs |
| 本文献已被 CNKI 维普 等数据库收录！ |
|
