On Subpancyclic Line Graphs

Liming Xiong*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

2 Citations (Scopus)

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 languageEnglish
Pages (from-to)67-74
Number of pages8
JournalJournal of Graph Theory
Volume27
Issue number2
DOIs
Publication statusPublished - Feb 1998
Externally publishedYes

Keywords

  • Line graph
  • Subpancyclic graph
  • The degree of an edge

Fingerprint

Dive into the research topics of 'On Subpancyclic Line Graphs'. Together they form a unique fingerprint.

Cite this