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


New Bounds for the Clique-Chromatic Numbers of Johnson Graphs
Authors:Raigorodskii  A M  Koshelev  M M
Institution:1.Moscow Institute of Physics and Technology (National Research University), 141700, Dolgoprudnyi, Moscow oblast, Russia
;2.Faculty of Mechanics and Mathematics, Lomonosov Moscow State University, 119991, Moscow, Russia
;3.Caucasus Mathematical Center, Adyghe State University, 385000, Maykop, Republic of Adygea, Russia
;4.Institute of Mathematics and Computer Science, Buryat State University, 670000, Ulan-Ude, Buryat Republic, Russia
;
Abstract:Doklady Mathematics - We significantly improve lower bounds on the clique-chromatic numbers for some families of Johnson graphs. A new upper bound on the clique-chromatic numbers for G(n, r, r...
Keywords:
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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