On Graph Having Clique Number α,Chromatic Number α+1
On Graph Having Clique Number α,Chromatic Number α+1出 版 物：《Journal of Mathematical Research with Applications》 (数学研究及应用(英文版))
年 卷 期：1991年第3期
页 面：400-400页
主 题：Graph Chromatic Number On Graph Having Clique Number
摘 要：Let G is a simple graph,ω(G).△(G)、x(G)are maximum clique number ofG,maximum degree and chromatic number of G ***[2],James defi-nes that(a,b,c)(where a,b,c are positive integer)is graphical if there existsG whichω(G)=a,x(G)=b,△(G)=*** say G is on(a,b,c)and set P(a,b,(a,b,c)=min{|V(G)||G is on(a,b,c)}.All other signs are from[1].
同方期刊数据库