摘要
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.
出版日期
2013年01月11日（中国期刊网平台首次上网日期，不代表论文的发表时间）
