Path Cover in $K_{1,4}$-Free Graphs
Received:July 17, 2018  Revised:October 26, 2018
Key Words: path cover   path cover number   $K_{1,4}$-free graph   non-insertable vertex  
Fund Project:Supported by the Joint Fund of Liaoning Provincial Natural Science Foundation (Grant No.SY2016012).
Author NameAffiliation
Mingda LIU College of Science, Liaoning University of Technology, Liaoning 121001, P. R. China 
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 
Hits: 1632
Download times: 1220
Abstract:
      
Citation:
DOI:10.3770/j.issn:2095-2651.2019.03.011
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.