# 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 213kB |

Abstract: | 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 is a connected graph on vertices such that for all four vertices of any path in , then the line graph is subpancyclic, unless is isomorphic to an exceptional graph. Moreover, we show that this result is best possible, even under the assumption that 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: | |

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 |

Repository Staff Only: item control page

Metis ID: 237586