### Abstract

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.

Original language | English |
---|---|

Pages (from-to) | 411-418 |

Number of pages | 8 |

Journal | Tokyo Journal of Mathematics |

Volume | 20 |

Issue number | 2 |

DOIs | |

Publication status | Published - 1997 Jan 1 |

### ASJC Scopus subject areas

- Mathematics(all)

## Fingerprint Dive into the research topics of 'Neighborhood conditions and k-Factors'. Together they form a unique fingerprint.

## Cite this

Iida, T., & Nishimura, T. (1997). Neighborhood conditions and k-Factors.

*Tokyo Journal of Mathematics*,*20*(2), 411-418. https://doi.org/10.3836/tjm/1270042114