Affiliation:
1. College of Mathematics and System Sciences, Xinjiang University, Urumqi 830046, P. R. China
Abstract
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.
Publisher
World Scientific Pub Co Pte Lt
Subject
Discrete Mathematics and Combinatorics
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Hajós-like theorem for signed graphs;European Journal of Combinatorics;2018-01
2. Disproof of the group coloring version of the Hadwiger conjecture;Discrete Mathematics, Algorithms and Applications;2014-06-16