排序方式： 共有2条查询结果，搜索用时 0 毫秒
1
1.
In[1],P.Paulraja posed the following problem:Let G be a 2-connected graph suchthat δ(G)≥3,where δ(G)denotes the minimum degree of G.If each edge of G lies on either a cycle oflength 3 or a cycle of length 4,is it true that G has a spanning Eulerian subgraph?A related case inwhich δ(G)≥4 is settled affairmatively in this paper. 相似文献
2.
BIPANCYCLISM IN HAMILTONIAN BIPARTITE GRAPHS 总被引：1，自引：1，他引：0
It is shown that if G is a hamiltonian bipartite graph on 2n vertices and δ(G)>2n/5 2,where n≥60,then G is bipancyclic. 相似文献
1