The Chromatic Spectrum of Mixed Hypergraphs

A mixed hypergraph is a triple H = (X, C, D), where X is the vertex set, and each of C, D is a list of subsets of X. A strict k-coloring of H is a surjection c : X {1, . . . , k} such that each member of C has two vertices assigned a common value and each member of D has two vertices assigned distinct values. The feasible set of H is {k: H has a strict k-coloring}. Among other results, we prove that a finite set of positive integers is the feasible set of some

• Type: Journal
• Year: 2002
• Where: GC
• Authors: Tao Jiang, Dhruv Mubayi, Zsolt Tuza, Vitaly I. Voloshin, Douglas B. West
• Keywords: Applied Computing, Feasible Set, GC 2002, Mixed Hypergraph, Strict K-coloring