## Some articles about applications of Mixed Hypergraph Coloring  in different areas:

### In WORM and similar/related graph coloring:

#### /brilliant examples showing that basic concepts of mixed hypergraph coloring provide a wealthy source of infinitely many beautiful problems in graph theory/

##### Special comment.  After you pick a class of graphs and two subgraphs of interest  for C- and D-edges,  the following questions become very interesting immediately:
1. conditions of uncolorability
2. conditions of unique colorability
3. values of the upper and lower chromatic numbers
4. continuity of the chromatic spectrum
5. perfection with respect to the upper chromatic number
6. the values of entries in the chromatic spectrum
7. chromatic polynomial (roots, coefficients)
8. algorithmic aspects  of finding all of the above

### In general graph and hypergraph coloring theory:

• D. Kral. Mixed Hypergraphs and other coloring problems. Discrete Mathematics 307 (7-8) (2007), 923-938.

### In coloring of Block Designs:

• 185. L. Milazzo, Zs. Tuza. Logarithmic upper bound for the upper chromatic number of $S(t,t+1,v)$ systems. Ars Combin. 92 (2009), 213–223.
• 143. M. Gionfriddo, L. Milazzo, A. Rosa, V. Voloshin. Bicoloring Steiner systems S(2,4,v). Discrete Mathematics, 283 (2004) 249-253.
• 123. L. Gionfriddo. P(3)-designs with gaps in the chromatic spectrum. Rendiconti Seminario Matematico Universita Messina 8 (2002), 49-58.
• 91. M. Buratti, M. Gionfriddo, L. Milazzo, V. Voloshin. Lower and upper chromatic numbers for BSTSs(2^h – 1). Comput. Sci. J. Moldova, Vol. 9, No 2, (2001), 259-272.
• 86. G. Lo Faro, L. Milazzo, A. Tripodi. On the Upper and Lower Chromatic Numbers of BSQSs(16). Electron. J. Combin. 8(1) (2001) R6.
• 83. G. Lo Faro, L. Milazzo, A. Tripodi. The first BSTS with different upper and lower chromatic numbers. Australas. J. Combin. 22 (2000), 123–133.
• 58. Ch. Colbourn, J. Dinitz and A. Rosa. Bicoloring Steiner Triple Systems. Electron. J. Combin. 6 (1999), R25.
• 57. Ch.J. Colbourn, A. Rosa. Triple Systems. Clarendon Press, Oxford, 1999 (section 18.6. Strict colorings and the upper chromatic number, p. 340-341).
• 44. L. Milazzo, Zs. Tuza. Strict Colourings for Classes of Steiner Triple Systems. Discrete Math., 182 (1998) 233-243.

### In Geombinatorics:

• 171. P. Johnson, V. Voloshin. Geombinatorial Mixed Hypergraph Coloring Problems. Geombinatorics, Vol XVII (2), 2007, 57-67.