摘要
具有度序列（1，1，2，2，2，…，2，3）的树图称为T形树。本文证明了一簇T形树是不可约的，从而证明了它们的补图的色唯一性。
The tree having degree sequence (1, 1, 1, 2, 2, ..2. 3)is called a tree of T-shape. In this paper,We discover a family of irreducible trees of T-shape,and prove chromatic uniqueness of their complementary graphs.
出处
《青海师专学报》
1997年第2期3-6,共4页
Journal of Qinghai Junior Teachers' College
