Premium
On subpancyclic line graphs
Author(s) -
Xiong Liming
Publication year - 1998
Publication title -
journal of graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.164
H-Index - 54
eISSN - 1097-0118
pISSN - 0364-9024
DOI - 10.1002/(sici)1097-0118(199802)27:2<67::aid-jgt2>3.0.co;2-d
Subject(s) - combinatorics , mathematics , line graph , conjecture , extremal graph theory , graph , circumference , discrete mathematics , graph theory , cubic graph , voltage graph , geometry
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). © 1998 John Wiley & Sons, Inc. J Graph Theory 27: 67–74, 1998