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 hyperg...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展开更多
The total chromatic number of a graph G=(V, E), called X_T(G) for short, is defined that X_T(G)=min {α| there is a colouring for V∪E with α, colours such that any two elements of V∪E which are adjacent or incident...The total chromatic number of a graph G=(V, E), called X_T(G) for short, is defined that X_T(G)=min {α| there is a colouring for V∪E with α, colours such that any two elements of V∪E which are adjacent or incident have different colours}.展开更多
文摘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
文摘The total chromatic number of a graph G=(V, E), called X_T(G) for short, is defined that X_T(G)=min {α| there is a colouring for V∪E with α, colours such that any two elements of V∪E which are adjacent or incident have different colours}.
