Acta Mathematicae Applicatae Sinica

, Volume 3, Issue 4, pp 298–304 | Cite as

On pancyclic line graphs

  • Shi Ronghua 


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


Line Graph Math Application Vertex Pancyclic 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    Harary, F., Graph Theory, Addison-Wesley, Reading, MA 1969.Google Scholar
  2. [2]
    Bondy, J. A., Pancyclic Graphs I,J. C. T., Ser. B,11 (1971), 80–84.Google Scholar
  3. [3]
    Chartrand, G. and Pippert, R. E., Locally connected graph,casopis pest. Math.,99 (1974), 158–163.Google Scholar
  4. [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. [5]
    Brualdi, R. A. and Shanny, R. F., Hamiltonian Line Graphs,J. Graph Theory,5 (1981), 307–314.Google Scholar
  6. [6]
    Clark, L., On Hamiltonian Line Graphs,J. Graph Theory,8 (1984), 303–307.Google Scholar
  7. [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

Copyright information

© Science Press, Beijing, China and Allerton Press, Inc. New York, U.S.A. 1987

Authors and Affiliations

  • Shi Ronghua 
    • 1
  1. 1.Qinghai Normal UniversityChina

Personalised recommendations