Longest Cycles in Claw-free Graphs
Received:June 18, 1990  
Key Words:   
Fund Project:
Author NameAffiliation
Li Mingchu Dept. of Math. & Mech.
Univ. of Sci. & Tech.
Beijing 
Li Zhongxiang Dept. of Math. & Mech.
Univ. of Sci. & Tech.
Beijing 
Hits: 1891
Download times: 1244
Abstract:
      It is proved that every 3-connected claw-free graph G of order n contains a cycle of length at least min{n,4k- 5}, where k is the minimum degree of G.
Citation:
DOI:10.3770/j.issn:1000-341X.1993.01.029
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.