Vertex-disjoint K1＋ （K1 ∪ K2） in Kl,4-free Graphs with Minimum Degree at Least Four

作者：Yun; Shu; GAO; Qing; Song; ZOU不相交最小度free图顶点吉隆坡曲线图图同构自由

摘要：A graph is said to be K1,4-free if it does not contain an induced subgraph isomorphic to K1,4.Let k be an integer with k≥2.We prove that ifG is a K1,4-free graph of order at least 11k-10 with minimum degree at least four,then G contains k vertex-disjoint copies of K1+(K1∪K2).

注：因版权方要求，不能公开全文，如需全文，请咨询杂志社