Abstract
We give a best possible Dirac-like condition for a graph G so that its line graph L(G) is subpancyclic, i.e., L(G) contains a cycle of length l for each l between 3 and the circumference of G. The result verifies the conjecture posed by Xiong (Pancyclic results in hamiltonian line graphs, in: Combinatorics and Graph Theory '95, vol. 2, Proceedings of the Summer School and International Conference on Combinatorics, World Scientific).
Original language | English |
---|---|
Pages (from-to) | 67-74 |
Number of pages | 8 |
Journal | Journal of Graph Theory |
Volume | 27 |
Issue number | 2 |
DOIs | |
Publication status | Published - Feb 1998 |
Externally published | Yes |
Keywords
- Line graph
- Subpancyclic graph
- The degree of an edge