海南师范大学学报（自然科学版）Issue(2)：131-133,3.
关于图的点色数和邻点可区别E-全色数
On Chromatic Number and Adjacent Vertex-dis-tinguishing E-total Chromatic Number of Graphs
摘要
Abstract
The chromatic number of a graphG, denoted byχ(G), is the minimum number k for which G has a proper k-vertex coloring. The adjacent vertex-distinguishing E-total chromatic number of G, denoted byχeat (G ), is the minimum number k for which G has an adjacent vertex-distinguishing E-total coloring. These two colorings seem to be different, but we proved that χ(G )=χeat (G ) when χ(G)≥4.关键词
点色数/邻点可区别E-全色数Key words
chromatic number/adjacent vertex-distinguishing E-total chromatic number引用本文复制引用
郑艺容,陈美润,翟绍辉..关于图的点色数和邻点可区别E-全色数[J].海南师范大学学报（自然科学版）,2015,(2):131-133,3.基金项目
国家青年自然科学基金项目（11301440）；福建省教育厅自然科学基金项目（JA13240，JB13155）；厦门理工学院科技项目 （）
