| 路核和路剖分 |
| |
| 引用本文： | 张玉平.路核和路剖分[J].西安邮电学院学报,2010,15(3):128-130. |
| |
| 作者姓名： | 张玉平 |
| |
| 作者单位： | 湖南环境生物职业技术学院公共基础课部,湖南衡阳,421005 |
| |
| 摘 要： | 改进了J.Edunbar和M.Frick所得的结果。通过找每一个围长大于(n-3)的图的一个Pn+1-半核,找到它的Pn+1-核,这样就可以对图进行剖分。从而得到:如果G是围长大于n-3的图,且τ(G)=a+b(其中1≤a≤b),那么G有一个(a,b)-剖分。
|
| 关 键 词： | 路核 路半核 (a b)-剖分 路剖分猜想 |
On path kernels and partitions |
| |
| ZHANG Yu-ping.On path kernels and partitions[J].Journal of Xi'an Institute of Posts and Telecommunications,2010,15(3):128-130. |
| |
| Authors: | ZHANG Yu-ping |
| |
| Affiliation: | ZHANG Yu-ping(Hunan College of Environment and Biology,Hengyang 421008,China) |
| |
| Abstract: | The improved the results of J.Edunbar and M.Frick.Through finds a Pn＋1-semikernel from any graph with girth greater than n-3,finds Pn＋1-kernel,so can partition the graph.Thus the conclusion： any graph with girth greater than（n-3） has a Pn＋1-kernel.Fur-theremore,if τ（G）=a＋b（1≤a≤b）,G has girth greater than a-3,then G has an（a,b）-partition. |
| |
| Keywords: | Path Kernel Path Semikernel （a b）-partition Path Partition Conjecture |
| 本文献已被 维普 万方数据 等数据库收录！ |
|
