What is Hypergraph coloring?

爱不到要偷

于 2012-08-22 15:44:00 发布

阅读量89

点赞数

CC 4.0 BY-SA版权

原文链接：http://www.cnblogs.com/york-hust/archive/2012/08/22/2650952.html

Hypergraph colouring is defined as follows. Let $H=(V, E)$ be a hypergraph such that $\Vert V\Vert = n$ . Then $C=\{c_1, c_2, \ldots, c_n\}$ (??) is a proper colouring of $H$ if and only if, for all $e \in E, \vert e\vert > 1,$ there exists $v_i, v_j \in e$ such that $c_i \neq c_j$ .

In other words: For every edge in the graph having at least two nodes as endpoints, the nodes this edge connects are not all of the same color.

A coloring of a hypergraph is a mapping of vertices to colors such that no hyperedge is monochromatic(单色的)

超边着色问题: H=(V,E),有n个点,有k种颜色,给每个点涂上一种颜色,使得任何一条边的所有点都不是相同的颜色

转载于:https://www.cnblogs.com/york-hust/archive/2012/08/22/2650952.html

评论

被折叠的条评论为什么被折叠?

到【灌水乐园】发言

查看更多评论

添加红包

成就一亿技术人!

hope_wisdom

发出的红包

实付元

使用余额支付

点击重新获取

扫码支付

钱包余额 0

抵扣说明：

1.余额是钱包充值的虚拟货币，按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载，可以购买VIP、付费专栏及课程。