Author/Authors :
E. van Blanken، نويسنده , , J. van den Heuvel، نويسنده , , H.J. Veldman، نويسنده ,
Abstract :
Let f(n) be the smallest integer such that for every graph G of order n with minimum degree δ(G) > f(n), the line graph L(G) of G is pancyclic whenever L(G) is hamiltonian. Results are proved showing that f(n) = Θ(n13).
