Disjoint K-4 in claw-free graphs with minimum degree at least five.pdfVIP

Front．Math．China2015，10(1)：5368 DOI10．1007／s11464-014一O43 y mlinnlimmuum degreeaattlleeaassttfiVvee YunshuGAO ，Qingsongzou 1SchoolofMathematicsandComputerScience，NingxiaUniversity，Yinchuan750021，China 2 DepartmentofMathematics，Xidian University，Xi’an 710071，China ⑥ HigherEducationPressandSpringer—VerlagBerlinHeidelberg2014 Abstract A graph iSsaid to beclaw—freeifitdoesnotcontain an induced subgraph isomorphicto K 13．LetK bethegraph obtained by removing exactlyoneedgefrom K4andletkbeanintegerwith ≥2．W_eprovethatif G isaclaw—freegraphoforderatleast13k一 12andwithm inimum degre