163 research outputs found

    Pancyclicity of Hamiltonian line graphs

    Get PDF
    Let f(n) be the smallest integer such that for every graph G of order n with minimum degree 3(G)>f(n), the line graph L(G) of G is pancyclic whenever L(G) is hamiltonian. Results are proved showing that f(n) = ®(n 1/3)
    • …
    corecore