HAJÓS-LIKE THEOREM FOR GROUP COLORING
Xinhui An, Baoyindureng Wu · Discrete Mathematics Algorithms and Applications · 2010
The group coloring of graphs is a new kind of graph coloring, introduced by Jaeger et al. in 1992, and the group chromatic number of a graph G is denoted by χg (G). In this note, we prove that for a positive integer k, a graph G with χg (G)>k can be obtained from any complete bipartite graph G0 with χg(G0)>k by certain types of graph operations.