Erds P, Lovsz L. Problems and results on 3-chromatic hypergraphs and some related questions[C]//Hajnal A. Infinite an Finite Sets. Amsterdam:North Holland,1975:609-628.
[2]
Alon N, McDiarmid C, Reed B. Acyclic coloring of graphs[J]. Random Structures Algorithms,1991,2(3):277-288.
[3]
Fu H Y, Xie D Z. A note on star chromatic number of graphs[J]. J Math Res Expo,2010,30(5):841-844.
[4]
Fertin G, Raspaud B, Reed B. Star coloring of graphs[J]. J Graph Theory,2004,47(3):163-182.
[5]
Grünbaum B. Acyclic colorings of planar graphs[J]. Israel J Math,1973,14(4):390-408.
[6]
Albertson M O, Chappell G G, Kersted H A, et al. Coloring with no 2-colored P4’s[J]. Electron J Combin,2004,11(1):1-13.
[7]
Nesetril J, de Mendez P O. Colorings and homomorphisms of minor closed classes[R]. Technical Report 476, Centre de Recerca Matematica,2001.
Bollobs B. Random Graphs[M]. London:Academic Press,1985.
[15]
Bondy J A, Murty U S R. Graph Theory[M]. Berlin:Springer-Verlag,2008.
[16]
Scott A D, Sokal A D. The repulsive lattice gas, the indenpendent-set polynomial, and the Lovsz local lemma[J]. J Statistical Phys,2005,118(5):1151-1265.
