Minimally 3-Connected Graphs with Exactly k Non-Essential Edges
Received:November 03, 2005  
Key Words: minimally 3-connected graph   non-essential edge   fan   wheel.  
Fund Project:the National Natural Science of China (10171022)
Author NameAffiliation
LIU Yu-xing Dept. of Math., Ganzhou Teacher's College, Jiangxi 341000, China 
SU Jian-ji College of Math. & Comput. Sci., Guangxi Normal University, Guilin 541004, China 
Hits: 3614
Download times: 1813
Abstract:
      
Citation:
DOI:10.3770/j.issn:1000-341X.2006.04.026
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.