| LONGEST CYCLES IN REGULAR 3—CONNECTED GRAPHS |
| |
| 引用本文： | 俞正光,朱永津,刘振宏.LONGEST CYCLES IN REGULAR 3—CONNECTED GRAPHS[J].系统科学与复杂性,1990(4). |
| |
| 作者姓名： | 俞正光 朱永津 刘振宏 |
| |
| 作者单位： | Department of Applied Mathematics Tsinghua University，Beijing，China，Institute of Systems Science，Academia Sinica，Beijing，China，Institute of Systems Science，Academia Sinica，Beijing，China |
| |
| 基金项目： | Research supported by the National Natural Science Foundation of China |
| |
| 摘 要： | It is proved that for k≥71,the circumference c(G)of a 3-connected k-regular graphG on n vertices is at least min{|G|,3k+5}.This result is essentially best possible.
|
| 本文献已被 CNKI 等数据库收录！ |
