On Graph Having Clique Number α,Chromatic Number α+1

被引:0
作者
Xu Baogang(Dept.Math.Shandong University
机构
关键词
Graph; Chromatic Number; On Graph Having Clique Number;
D O I
暂无
中图分类号
学科分类号
摘要
Let G is a simple graph,ω(G).△(G)、x(G)are maximum clique number ofG,maximum degree and chromatic number of G respectively.In[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)=c.We 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].
引用
收藏
页码:400 / 400
页数:1
相关论文
empty
未找到相关数据