Good and nice colorings of balanced hypergraphs

Good k  -colorings have been defined by C. Berge who showed their existence in balanced hypergraphs. There is a simple generalization to oriented balanced hypergraphs: using the bi-coloring characterization of 0,±10,±1-matrices of M. Conforti and G. Cornuejols, we show that oriented balanced hypergraphs have good k-colorings for any k. A stronger type of coloring is also shown to exist for oriented balanced hypergraphs.