Longest Cycles in 2-Connected Quasi-Claw-Free Graphs
Received:June 04, 2012  Revised:July 07, 2013
Key Words: quasi-claw-free graph   claw-free graph.  
Fund Project:Supported by the National Natural Science Foundation of China (Grant No.60673046).
Author NameAffiliation
Xiaodong CHEN College of Science, Liaoning University of Technology, Liaoning 121001, P. R. China 
Mingchu LI School of Softsware, Dalian University of Technology, Liaoning 116024, P. R. China 
Xin MA Basic Science Department, Shenyang Urban Construction University, Liaoning 110167, P. R. China 
Hits: 3267
Download times: 2859
Abstract:
      
Citation:
DOI:10.3770/j.issn:2095-2651.2014.01.003
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.