Subpancyclicity of line graphs and degree sums along paths

详细信息	查看全文 | 推荐本文 |

• 作者：Liming Xiong and H.J. Broersma
• 关键词：Degree sums ; Line graph ; Subpancyclicity ; Pancyclic graph ; Hamiltonian graph
• 刊名：Discrete Applied Mathematics
• 出版年：2006
• 期刊代码：46_0166218x
• 类别：cp
• 出版时间：1 June 2006
• 卷：154
• 期：9
• 页码：1453-1463
• 文件大小：208 K

摘要

A graph is called subpancyclic if it contains a cycle of length ℓ for each ℓ between 3 and the circumference of the graph. We show that if G is a connected graph on n146 vertices such that d(u)+d(v)+d(x)+d(y)>(n+10/2) for all four vertices u,v,x,y of any path P