The Winimum Degree of a Critically n-Line-Connected Graph
Received:May 03, 1982  
Key Words:   
Fund Project:
Author NameAffiliation
Shu Jianji Guangxi Normal University 
Hits: 2542
Download times: 1103
Abstract:
      
Citation:
DOI:10.3770/j.issn:1000-341X.1986.01.044
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.