简介:LetP(G,λ)bethechromaticpolynomialofagraphG.TwographsGandHaresaidtobechromaticallyequivalent,denotedG~H,ifP(G,λ)=P(H,λ).Wewrite[G]={H|H~G}.If[G]={G},thenGissaidtobechromaticallyunique.Inthispaper,wefirstcharacterizecertaincomplete6-partitegraphswith6n+1verticesaccordingtothenumberof7-independentpartitionsofG.Usingtheseresults,weinvestigatethechromaticityofGwithcertainstarormatchingdeleted.Asaby-product,manynewfamiliesofchromaticallyuniquecomplete6-partitegraphswithcertainstarormatchingdeletedareobtained.