| 关于不可约的T形树图 |
| |
| 引用本文： | 刘儒英.关于不可约的T形树图[J].青海师专学报,1997,17(2):3-6. |
| |
| 作者姓名： | 刘儒英 |
| |
| 作者单位： | 青海师范大学数学系!西宁，810008 |
| |
| 摘 要： | 具有度序列的树图称为Ｔ形树。本文证明了一簇Ｔ形树是不可约的，从而证明了它们的补图的色唯一性。
|
| 关 键 词： | 树图 不可约性 色唯一性 T形树图 |
On the Irreducible Trees of T-shape |
| |
| Liu Ruying.On the Irreducible Trees of T-shape[J].Journal of Qinghai Junior Teachers' College,1997,17(2):3-6. |
| |
| Authors: | Liu Ruying |
| |
| Institution: | Qinghai Normal University |
| |
| Abstract: | 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. |
| |
| Keywords: | Trees Irreducibility Chromatic uniqueness |
| 本文献已被 CNKI 维普 等数据库收录！ |
|
