论文信息 - Some Theorems Concerning the Star Chromatic Number of a Graph - 字舞流文

Some Theorems Concerning the Star Chromatic Number of a Graph

We investigate the notion of the star chromatic number of a graph in conjunction with various other graph parameters, among them, clique number, girth, and independence number.

[1] Vojtech Rödl,et al. A short proof of the existence of highly chromatic hypergraphs without short cycles , 1979, J. Comb. Theory, Ser. B.

[2] A. Vince,et al. Star chromatic number , 1988, J. Graph Theory.

[3] David R. Guichard,et al. Acyclic graph coloring and the complexity of the star chromatic number , 1993, J. Graph Theory.

[4] P. Erdös,et al. Graph Theory and Probability , 1959 .

[5] Igor Kríz,et al. Ahypergraph-free construction of highly chromatic graphs without short cycles , 1989, Comb..

[6] Bing Zhou,et al. The star chromatic number of a graph , 1993, J. Graph Theory.

[7] Pavol Hell,et al. A note on the star chromatic number , 1990, J. Graph Theory.

[8] L. Lovász. On chromatic number of finite set-systems , 1968 .

[9] Xuding Zhu. Star chromatic numbers and products of graphs , 1992, J. Graph Theory.