Apr 26, 2001 � from the vertex set to a set of k colors so that each C-edge has two vertices with a common color and each D-edge has two vertices with�...
1. E. Bulgaru, V.I. Voloshin. Mixed Interval Hypergraphs � 2. Zs. Tuza, V. Voloshin, H. Zhou, Uniquely colorable mixed hypergraphs, submitted. � 3. Zs. Tuza, V.
A mixed hypergraph is k-colorable (uncolorable; uniquely colorable) if it has a proper coloring with at most k colors (admits no colorings; admits precisely one�...
A mixed hypergraph consists of two families of edges: the C-edges and D-edges. In a coloring, every C-edge has at least two vertices of the same color,�...
We survey results and open problems on 'mixed hypergraphs' that are hyper- graphs with two types of edges. In a proper vertex coloring the edges of the.
Uniquely colorable and circular mixed hypergraphs. 6th Twente Workshop on Graphs and Combinatorial Optimization, 26-28 May, 1999, H.J. Broersma, U.Faigle�...
We propose an algorithm to color the ( r , r ) -uniform, complete, circular, mixed hypergraphs for all feasible values with no gaps.
Mixed hypergraph H is called uniquely colorable (uc for short) if it admits precisely one feasible partition. UC hypergraphs represent a generalization of�...
Uniquely colorable mixed hypergraphs. Chapter 6. C-perfect mixed hypergraphs ... Circular mixed hypergraphs. Chapter 11. Planar mixed hypergraphs. Chapter�...
A mixed hypergraph is a triple H = (X, C,D), where X is the vertex set and each of C, D is a family of subsets ofX, the C-edges and D-edges, respectively.