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


On chromatic numbers of nearly Kneser distance graphs
Authors:A V Bobu  A E Kupriyanov  A M Raigorodskii
Abstract:A family of distance graphs whose structure is close to that of Kneser graphs is studied. New lower and upper bounds for the chromatic numbers of such graphs are obtained, and relations between these numbers are considered. The structure of certain important independent sets of the family of graphs under consideration is described, and the cardinalities of these sets are explicitly calculated.
Keywords:
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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