摘要：A mixed hypergraph H=(X,C,D) consists of the vertex set X and two families of subsets: the family C of C-edges and the family D of D-edges. In a coloring, every C-edge has at least two vertices of common color, while every D-edge has at least two vertices of different colors. The largest (smallest) number of colors for which a coloring of a mixed hypergraph H using all the colors exists is called the upper (lower) chromatic number and is denoted not(X)(H) (X(H)). We consider integer programming models for colorings of mixed hypergraphs in order to show that algorithms for optimal colorings may be transformed and used for finding optimal solutions of the respective integer programming problems.
