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


The semi-chromatic number of a graph
Authors:V. G. Vizing
Affiliation:14278. ul. Varnenskaya 18/2, ap. 26, Odessa, 65070, Ukraine
Abstract:We introduce the notion of the semi-chromatic number of a graph with a nonempty number of edges. Then we prove that the difference between the semi-chromatic number and the half of the chromatic number is at most 1.
Keywords:
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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