hypergraphs

hypergraphs

美 　英

• 网络超图的理论

例句

Finally, we give the algorithm of finding chromatic feasible set of several types mixed hypergraphs.

最后给出几类混合超图色可行集的算法，并证明其算法的可行性。

This paper will use such non-constructive probabilistic method to solve the problems in coloring theory of mixed-hypergraphs.

本文主要就是利用这种非构造性概率方法来解决混合超图染色理论中的一些问题。

On the coloring of C-hypergraphs with minimum connected pair graphs

具有最小连通点对图的C-超图的染色讨论