| 最小度不小于3的图的圈长问题 |
| |
| 引用本文： | 周垂香.最小度不小于3的图的圈长问题[J].数学研究,2011,44(3):270-282. |
| |
| 作者姓名： | 周垂香 |
| |
| 作者单位： | 福州大学离散数学与理论计算机研究中心,福建福州,350003 |
| |
| 基金项目： | supported by the National Science Foundation of China(10801033); Provincial Science Foundation of Fujian Province(2008J0193) |
| |
| 摘 要： | Bondy和Vince曾证明最小度不小于3的图包含两个长度相差为1或者2的圈，这个结果回答了ErdSs提出的问题．Haggkvist和scott证明了除肠外，所有的3-正则图都包含两个长度相差2的圈．通过不同的方法，我们得到了下面的结论：除了每个端块都是硒的图外，所有最小度不小于3的图都包含两个长度相差2的圈．
|
| 关 键 词： | 最小度 圈 长度 |
Cycles in Graphs with Minimum Degree at Least Three |
| |
| Zhou Chuixiang.Cycles in Graphs with Minimum Degree at Least Three[J].Journal of Mathematical Study,2011,44(3):270-282. |
| |
| Authors: | Zhou Chuixiang |
| |
| Institution: | Zhou Chuixiang (Center for Discrete Mathematics Fuzhou University,Fuzhou Fujian 350003) |
| |
| Abstract: | Bondy and Vince proved that every graph with minimum degree at least three contains two cycles whose lengths differ by one or two, which answers a question raised by ErdSs. Haggkvist and Scott proved that every connected 3-regular graph other than K4 contains two cycles whose lengths differ by two. By a different approach, we obtain that every graph with minimum degree at least three contains two cycles whose lengths differ by two, unless each endblock of the graph is K4. |
| |
| Keywords: | minimum degree cycles length of cycle |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
