TY - JOUR
T1 - On Subpancyclic Line Graphs
AU - Xiong, Liming
PY - 1998/2
Y1 - 1998/2
N2 - 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).
AB - 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).
KW - Line graph
KW - Subpancyclic graph
KW - The degree of an edge
UR - http://www.scopus.com/inward/record.url?scp=0032326532&partnerID=8YFLogxK
U2 - 10.1002/(SICI)1097-0118(199802)27:2<67::AID-JGT2>3.0.CO;2-D
DO - 10.1002/(SICI)1097-0118(199802)27:2<67::AID-JGT2>3.0.CO;2-D
M3 - Article
AN - SCOPUS:0032326532
SN - 0364-9024
VL - 27
SP - 67
EP - 74
JO - Journal of Graph Theory
JF - Journal of Graph Theory
IS - 2
ER -