EDGE-DISJOINT HAMILTONIAN CYCLES IN GRAPHS  

作　　者：李明楚 刘振宏 

机构地区：[1]Department of Mathematics, Beijing University of Science and Technology, Beijing 100083, PRC [2]Institute of Systems Science, Academia Sinica, Beijing 100080, PRC

出　　处：《Chinese Science Bulletin》1991年第12期1055-1056,共2页

摘　　要：All graphs considered here are undirected and finite, without loops or multiple edges. Let δ(G)denote the minimum degree of a graph G. A graph G is called Ore-type-(k)(where k is an integer) if d(u)+d(v)≥|V(G)|+k for every two nonadjacent vertices u and v.

关 键 词：undirected INTEGER VERTEX CONJECTURE 

分 类 号：N[自然科学总论]