Every 3-connected $$\{K_{1,3},N_{1,2,3}\}$$ { K 1 , 3 , N 1 , 2 , 3 } -free graph is Hamilton-connected
Crossref DOI link: https://doi.org/10.1007/s00373-015-1598-2
Published Online: 2015-06-26
Published Print: 2016-03
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Hu, Zhiquan
Zhang, Shunzhe
Funding for this research was provided by:
NSFC (11371062)
NSFC (11271149)
Text and Data Mining valid from 2015-06-26