Unique colorings of bi-hypergraphs

Unique colorings of bi-hypergraphs
复制标题

DOI:
--
复制
发表时间:
2003
期刊:
Australas. J Comb.
影响因子:
--
通讯作者:
G. Bacsó;Z. Tuza;V. Voloshin
G. Bacsó;Z. Tuza;V. Voloshin
中科院分区:
其他
文献类型:
--
作者:
G. Bacsó;Z. Tuza;V. Voloshin

文献摘要

被引文献

相似文献

本文讨论了只有一个划分的一致超图的性质(即,除了颜色的置换之外的唯一着色),条件是在每个边中存在恰好属于划分的两个类的三个顶点。特别是,我们调查之间的关系,独特的可着色性,颜色的数量,和色类的基数。
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.