边共色数下图的分类问题  

Classification of graphs based on the edge-cochromatic number

作　　者：黎虹[1] 刘信生[2] 

机构地区：[1]甘肃农业大学理学院,甘肃兰州730070 [2]西北师范大学数学与信息科学学院,甘肃兰州730070

出　　处：《长春工业大学学报》2011年第6期615-618,共4页Journal of Changchun University of Technology

摘　　要：利用Lowell Beineke和Richard Ringeisen给出的边共色数的界,提出了根据边共色数对图进行分类的分类方法,以及用这种方法判定图类的几个充分条件;得出了图的这种分类方式与边色数下分类方式之间的联系,并给出了具体图例。The bound of the edge-cochromatic number is given by means of Lowell Beineke and Richard Ringeisen.We offer the graph classification method and sufficient conditions to judge the graphs according the edge-cochromatic number.The relationship between the graph classification and edge chromatic number classification is given,and some examples are shown here.

关 键 词：边共色数 界 分类 A类图 

分 类 号：O157.5[理学—数学]