首页 | 本学科首页   官方微博 | 高级检索  
     


An upper bound for the harmonious chromatic number of a graph
Authors:Sin-Min Lee  John Mitchem
Abstract:An upper bound for the harmonious chromatic number of a graph G is given. Three corollaries of the theorem are theorems or improvements of the theorems of Miller and Pritikin.
Keywords:
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号