TY - JOUR

T1 - Neighborhood conditions and k-Factors

AU - Iida, Tadashi

AU - Nishimura, Tsuyoshi

PY - 1997/1/1

Y1 - 1997/1/1

N2 - Let k be an integer such that k≥2, and let G be a connected graph of order n such that [Math equation] kn is even, and the minimum degree is at least k. We prove that if[Math equation] for each pair of nonadjacent vertices u, v of G, then G has a k-factor.

AB - Let k be an integer such that k≥2, and let G be a connected graph of order n such that [Math equation] kn is even, and the minimum degree is at least k. We prove that if[Math equation] for each pair of nonadjacent vertices u, v of G, then G has a k-factor.

UR - http://www.scopus.com/inward/record.url?scp=0012910313&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0012910313&partnerID=8YFLogxK

U2 - 10.3836/tjm/1270042114

DO - 10.3836/tjm/1270042114

M3 - Article

AN - SCOPUS:0012910313

VL - 20

SP - 411

EP - 418

JO - Tokyo Journal of Mathematics

JF - Tokyo Journal of Mathematics

SN - 0387-3870

IS - 2

ER -