The Incidence Chromatic Number of 1-Tree
Dong Chen · 2002
In this paper some structural properties of 1-tree are presented.It is proved that if G is a 2-edge-connected 1-tree graph then there is a (Δ+2)-incidence coloring such that the same color is assigned on far-incidence of each vertex.Moreover it is determined that it's incidence chromatic number equals to Δ the maximum degree of the graph plus one.