A Degree Condition for the Circumference of a Graph
Received:January 08, 1998  
Key Words: path   circumference  key-pair.  
Fund Project:
Author NameAffiliation
ZHU Yong-jin Institute of Systems Science, Academia Sinica, Beijing 100080, China 
ZHOU Jie Dept. of Math., Northeast Normal Univ., Changchun, Jilin 130024, China 
Hits: 2078
Download times: 1257
Abstract:
      We present a new condition on the degree sums of a graph that implies the existence of a long cycle. Our result is a generalization of the previous one of N.Dean and P. Fraiss.
Citation:
DOI:10.3770/j.issn:1000-341X.2001.01.011
View Full Text  View/Add Comment  
  Copyright © Journal of Mathematical Research with Applications
Sponsored by：Dalian University of Technology, China Society for Industrial and Applied Mathematics
Address：No.2 Linggong Road, Ganjingzi District, Dalian City, Liaoning Province, P. R. China , Postal code ：116024
Service Tel：86-411-84707392 Email：jmre@dlut.edu.cn
Designed by Beijing E-tiller Co.,Ltd.
Due to security factors, early browsers cannot log in. It is recommended to log in with IE10, IE11, Google, Firefox, and 360 new browsers.