搜索结果: 1-3 共查到“系统学 Generalization”相关记录3条 . 查询时间(0.062 秒)
Let G be a 2-connected simple graph of order n. In this paper we prove the following generalization of Ore's theorem: If G is a 2-connected graph such that |N(u) \cup N(v)|+|N(u) \cup N(w)| ≥ n for ev...
l. By c(G) we denote the length of the longest cycle in G; in particular, G is called a Hamiltonian graph if c(G)=n. H.A. Jung proved that every 1-tough graph with order n≥11 and σ2≥n-4 is Hamiltonian...
A generalization of the well-known n-queen problem is to put N×k‘queens’on an k×n chessboard in such a way that each row and each column contains exactly k‘queens’and each diagonal with length from 1 ...