hypergraphs

美 　英

• 網(wǎng)絡(luò)超圖的理論

例句

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.

本文主要就是利用這種非構(gòu)造性概率方法來(lái)解決混合超圖染色理論中的一些問(wèn)題。

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

具有最小連通點(diǎn)對(duì)圖的C-超圖的染色討論