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.
Similar content being viewed by others
References
Harary, F., Graph Theory, Addison-Wesley, Reading, MA 1969.
Bondy, J. A., Pancyclic Graphs I,J. C. T., Ser. B,11 (1971), 80–84.
Chartrand, G. and Pippert, R. E., Locally connected graph,casopis pest. Math.,99 (1974), 158–163.
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.
Brualdi, R. A. and Shanny, R. F., Hamiltonian Line Graphs,J. Graph Theory,5 (1981), 307–314.
Clark, L., On Hamiltonian Line Graphs,J. Graph Theory,8 (1984), 303–307.
Harary, F. and C. St. J. A. Nash-Williams, On Eulerian and Hamiltonian Graphs and Line Graphs,Canad. Math. Bull.,8 (1965), 707–709.
Author information
Authors and Affiliations
Rights 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
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02008367