| 一类Halin-图的均匀色数 |
| |
| 引用本文： | 王骁力.一类Halin-图的均匀色数[J].南都学坛,2000,20(6):3-6. |
| |
| 作者姓名： | 王骁力 |
| |
| 作者单位： | 南阳师范学院,数学系,河南,南阳,473061 |
| |
| 基金项目： | 河南省教委自然科学基金资助项目(98110019) |
| |
| 摘 要： | 对Δ(G) =4的Halin -图证明了 |V(G) | 0 (mod3)时 ,对任意整数的k≥「Δ(G) / 2 +1,G是可均匀k -可着色的。从而证明了这类Halin -图的均匀染色数的下界是「Δ(G) / 2 +1。
|
| 关 键 词： | Halin-图 均匀染色 均匀染色数 |
| 文章编号： | 1002-6320(2000)06-0003-04 |
| 修稿时间： | 2000年5月20日 |
On Equitable Coloring of Halin-graphs |
| |
| WANG Xiao,li.On Equitable Coloring of Halin-graphs[J].Academic forum of nandu,2000,20(6):3-6. |
| |
| Authors: | WANG Xiao li |
| |
| Abstract: | A graph G is said to be equitably k colorable if the vertices of G can be partitioned into k independent sets V 1,V 2,…V k ,such that ｜｜ V i ｜-｜ V j ｜｜｜≤1 for all i and j.A Halin graph G is a 3 connected planar graph with a face f 0 such that G E(f 0) is a tree,and the minimal degree of G is at least 3. We show that a Halin graph G is equitably k colorable if k ≥「Δ(G)/2?+1,which is true for all Halin Graphs except K 4 and Δ( G )=4,｜V( G )｜≡0(mod3) |
| |
| Keywords: | Halin graph equitably k colorable |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
