摘要
Throughout this letter, all graphs will be finite, undirected, simple graphs. A K1,3-free graph is a graph with no induced subgraph isomorphic to K1,3. In 1980, B. Jackson proved that all 2-connected, k-regular graphs on at most 3k vertices are Hamiltonian. Further, in 1986, Y. J. Zhu, Z. H. Liu and Z. F. Yu
