Some Properties of Group Color Criticality of Graphs
Liqiong Xu · Journal of Fujian Normal University · 2004
G is a graph, its group chromatic number χ_1(G) is the minimum number m for which G is A-colorable for any Abelian group A of order≥ m under the orientation D.G is a group color critical, if for any subgraph H of G,χ_1(H)χ_1(G), investigate group color criticality of graphs and characterize some graphs which is group color critical, prove that the minimum degree of k group color criticality of graph is k-1,and G is 3 group color critical if and only if G is cycle.