UPPER-BOUNDS FOR HARMONIOUS COLORINGS

被引：10
|
作者：
MCDIARMID, C [1 ]
LUO, XH [1 ]
机构：
[1] UNIV SCI & TECHNOL CHINA,DEPT COMP SCI,HEFEI,PEOPLES R CHINA
来源：
JOURNAL OF GRAPH THEORY | 1991年 / 15卷 / 06期
关键词：
D O I：
10.1002/jgt.3190150606
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
A harmonious coloring of a simple graph G is a coloring of the vertices such that adjacent vertices receive distinct colors and each pair of colors appears together on at most one edge. The harmonious chromatic number h(G) is the least number of colors in such a coloring. We improve an upper bound on h(G) due to Lee and Mitchem, and give upper bounds for related quantities.
引用
收藏
页码：629 / 636
页数：8
相关论文
共 50 条
12345