图的关联色数和关联着色猜想  

THE INCIDENCE CHROMATIC NUMBER AND THE INCIDENCE COLORING CONJECTURE OF GRAPHS

作　　者：陈东灵[1] 刘西奎 王淑栋[1] 

机构地区：[1]山东矿业学院应用数学与软件工程系,泰安271019

出　　处：《经济数学》1998年第3期47-51,共5页Journal of Quantitative Economics

摘　　要：本文综述了图的关联着色的已有结果，证明了关联着色猜想对于完全3—部图和高度留成立，确定了路、圈、扇、轮和加边轮等特殊图类的关联色数．In this paper,we overviewed all results of the incidence coloring of graphs. we proved the incidence conkcture holds for comple tripartite graph and high-degree graphs,and determined the incidence chromatic number of path,cycle,fan,wheel and add-edges wheel et al. special graphic family.

关 键 词：图 关联着色 关联色数 

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