【摘要】 Richard 定义了图的关联着色,并且提出了一个猜想:每一个图都能用△+2种颜色正常关联着色.本文证明了:（1）P₁类图的关联色数为△（G）+1;（2）P₂类图满足关联色数猜想,并且界是可以达到的.更多还原

【Abstract】 The definition of incidence coloring for graph is given.The supposition on normal incidence coloring for every graph with △+2 color is put forward.The incidence chromatic number of P₁ graph is △（G）+1 and satisfied incidence chromatic number of P₂ graph are proved.更多还原