摘要
The cycle-chromatic number of a hypergraph H, denoted by c（H）, is defined to be the minimum number of colours needed to colour the vertices of H such that no cycle in H is monochromatic. We proved that, for a hypergraph H=（V;E1,E2,…, Em） with n vertices, p components, and c（H）= c, we
