Chromatic numbers of hypergraphs and coverings of graphs
Zevi Miller, Heinrich Müller · Journal of Graph Theory · 1981
Abstract Burr recently proved [3] that for positive integers m1, m2……mk, and any graph G we have X(G) if and only if G can be expressed as the edge disjoint union of subgraphs Fi satisfying X(Fi) ≤ mi. This theorem is generalized to hypergraphs. By suitable interpretations the generalization is then used to deduce propositions on coverings of graphs.