A mixed hypergraph is a triple H = (V, C, D) where V is the vertex set and C and D are families of subsets of V , the C-edges and D-edges, respectively. A k-colouring of H is a ma...
Abstract. The aim of this paper is to present an improvement of a previously published algorithm. The proposed approach is performed in two steps. In the first step, we generate t...
Abstract. We outline a general theory of graph polynomials which covers all the examples we found in the vast literature, in particular, the chromatic polynomial, various generaliz...
In Ziegler (2002), the second author presented a lower bound for the chromatic numbers of hypergraphs KGr sssS, “generalized r-uniform Kneser hypergraphs with intersection multi...
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}...
Tao Jiang, Dhruv Mubayi, Zsolt Tuza, Vitaly I. Vol...