|
|||||
|
|
| Longest Cycles in 2-Connected Regular Claw-Free Graphs | |
| 作者姓名： | 李明楚 |
| 摘 要： | All graph considered In this paper are undirected and finite,without loops ormultip1e edges.A graph is called claw-free if it does not contain a copy of K_(1,3)as an induced subgraph.For a graph C,let δ(G)denote the minimum degree of G.There have been a great many results in recent years dealing with longest cycles.for example, M.Matthews and D.Summer have shown the following result: |
| 本文献已被 CNKI 等数据库收录！ | |