Subpancyclicity of line graphs and degree sums along paths

Xiong, L. and Broersma, H.J. (2006) Subpancyclicity of line graphs and degree sums along paths. Discrete Applied Mathematics, 154 (9). pp. 1453-1463. ISSN 0166-218X

PDF
Restricted to UT campus only: Request a copy
208Kb

Abstract:	A graph is called subpancyclic if it contains a cycle of length $\ell$ for each $\ell$ between 3 and the circumference of the graph. We show that if $G$ is a connected graph on $n\ge 146$ 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=uvxy$ in $G$ , then the line graph $L(G)$ is subpancyclic, unless $G$ is isomorphic to an exceptional graph. Moreover, we show that this result is best possible, even under the assumption that $L(G)$ is hamiltonian. This improves earlier sufficient conditions by a multiplicative factor rather than an additive constant.
Item Type:	Article
Faculty:	Electrical Engineering, Mathematics and Computer Science (EEMCS)
Research Group:	Discrete Mathematics and Mathematical Programming (DMMP)
Link to this item:	http://purl.utwente.nl/publications/63660
Official URL:	http://dx.doi.org/10.1016/j.dam.2005.05.039
Export this item as:	BibTeX EndNote HTML Citation Reference Manager

Show download statistics for this publication

Repository Staff Only: item control page

Metis ID: 237586