Spanning Trees with Few Leaves in Almost Claw-Free Graphs
Received:October 20, 2015  Revised:April 15, 2016
Key Words: spanning 3-ended tree   almost claw-free graph   insertible vertex, non-insertible vertex  
Fund Project:Supported by the National Natural Science Foundation of China, Tian Yuan Special Foundation (Grant No.11426125), by Educational Commission of Liaoning Province (Grant No.L2014239).
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 
Meijin XU College of Science, Liaoning University of Technology, Liaoning 121001, P. R. China 
Hits: 3305
Download times: 2214
Abstract:
      
Citation:
DOI:10.3770/j.issn:2095-2651.2016.04.007
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.