Skip to main content
Log in

On pancyclic line graphs

  • Published:
Acta Mathematicae Applicatae Sinica Aims and scope Submit manuscript

Abstract

In this paper, we give a best possible Ore-like condition for a graph so that its line graph is pancyclic or vertex pancyclic.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Harary, F., Graph Theory, Addison-Wesley, Reading, MA 1969.

    Google Scholar 

  2. Bondy, J. A., Pancyclic Graphs I,J. C. T., Ser. B,11 (1971), 80–84.

    Google Scholar 

  3. Chartrand, G. and Pippert, R. E., Locally connected graph,casopis pest. Math.,99 (1974), 158–163.

    Google Scholar 

  4. Oberly, D. J. and Sumner, D. P., Every connected, Locally Connected Nontrivial Graph with no Induced Claw is Hamiltonian,J. Graph Theory,3 (1979), 351–356.

    Google Scholar 

  5. Brualdi, R. A. and Shanny, R. F., Hamiltonian Line Graphs,J. Graph Theory,5 (1981), 307–314.

    Google Scholar 

  6. Clark, L., On Hamiltonian Line Graphs,J. Graph Theory,8 (1984), 303–307.

    Google Scholar 

  7. Harary, F. and C. St. J. A. Nash-Williams, On Eulerian and Hamiltonian Graphs and Line Graphs,Canad. Math. Bull.,8 (1965), 707–709.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Shi, R. On pancyclic line graphs. Acta Mathematicae Applicatae Sinica 3, 298–304 (1987). https://doi.org/10.1007/BF02008367

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02008367

Keywords

Navigation