【摘要】 设H是具有两个2度点的2-树,用H_s记作用一条长为s的道路联结H的两个2度点所得到的图。本文证明了当1V(H)=7,s≥2时,图H_s是色唯一的。作为推论,当n≥8时,图W(n,6)是色唯一的,从而解决了文献[3]中的问题2。更多还原

【Abstract】 Let H be a 2-tree with two vertices of degree two, Hs denotes the graph obtained by joining two vertices of degree two of H with a path of length S. In this paper the authors prove that Hs is chromatically unique if |V(H)| =7 and s≥2. This solves a problen in K. M. Koh and K. L. Teo[3].更多还原