The Strong Star Chromatic Numbers of Hypergraphs
Z Houchun, D Lihua · Or Transactions · 1999
The concept of star chromaiic number of a graph,introduced by Vince (1988) is a natural generalization of the chromatic number of a graph. In this paper we introduce stong star chromatic number of hypergraphs and study their basic properties. In particular,this paper calculates the strong star chrmomatic number of the 3-uniform circular hypergraphs,more precisely,the 3-uniform circular hypergraphs has strong star chromatic numbers forming an infinite decreasing sequence between 3 and 4.