Abstract

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 , ± 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.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call