We shall consider partitions of the edges of graphs and hypergraphs . 我們將考慮圖和超圖的邊的劃分。
Hypergraphs are the generalization of graphs 超圖是圖的重要的推廣。
The counting series for acyclic linear homeorphically k irreducible hypergraphs 不可約超圖的計數(shù)
In this thesis the relations among the parameters of hypergraphs and colourings of hypergraphs are discussed . this thesis consists of four chapters 本學(xué)位論文主要討論超圖中各參數(shù)間的關(guān)系以及超圖的邊色數(shù)問題,全文分4章。
The domination sets and perfect domination sets in hypergraphs are researched , and the conditions of sufficient and necessary of domination sets and perfect domination sets are given 摘要研究超圖的控制集和完美控制集并給出超圖的控制集和完美控制集存在的充分必要條件。