We discuss the properties of uniform hypergraphs which have precisely one partition (i.e., a unique coloring apart from permutation of the colors) under the condition that in each edge, there exist three vertices which belong to precisely two classes of the partition. In particular, we investigate the relation between unique colorability, number of colors, and the cardinalities of color classes.
|Number of pages||13|
|Journal||Australasian Journal of Combinatorics|
|Publication status||Published - Dec 1 2003|
ASJC Scopus subject areas
- Discrete Mathematics and Combinatorics