【摘要】 图G的无圈染色是满足任意两个色类的并的导出子图不含圈的正常点染色.G的无圈染色所用最少的颜色数称为G的无圈色数，记为a(G),从而得到了两类n-部图及其补图的无圈色数.更多还原

【Abstract】 The acyclic coloring of a graph is a proper vertex coloring such that the union of any two color classes induces a graph containing no cycles.The acyclic chromatic number of G,denoted a(G),is the minimum number of colors in an acyclic vertex coloring of.The acyclic chromatic number of two types of n-partite graph and its complement are obtained in this paper.更多还原