@article{oai:teapot.lib.ocha.ac.jp:00034810,
 author = {Nara, Chie},
 issue = {2},
 journal = {お茶の水女子大學自然科學報告},
 month = {Dec},
 note = {application/pdf, 紀要論文, A graph G=(V, E) is called a complete semi-bigraph and denoted by K'(l, m) if the vertex set can be partitioned into two subsets V_1(|V_1|=l) and V_2(|V_2|=m) such that [u, v]∉E for every u, v∈V_1(u≠v), and [v_1, v_2]∈E for every v_1∈V_1 and v_2∈V_2. THEOREM. Let G=(V, E) be an undirected 2-connected graph with n≧3 vertices and satisfying the following: [u, v]∉E⇒d(u)+d(v)≧n-1. Then G is either hamiltonian or a complete semi-bigraph K'(n+1/2, n-1/2). In particular, if n is even, then G must be hamiltonian.},
 pages = {75--80},
 title = {On Sufficient Conditions for a Graph to be Hamiltonian},
 volume = {31},
 year = {1980}
}