### Abstract

Let k be a positive integer, and let G be a graph of order n with n ≧ 4 k - 5, kn even and minimum degree at least k. We prove that if the degree sum of each pair of nonadjacent vertices is at least n, then G has a k-factor.

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

Pages (from-to) | 353-361 |

Number of pages | 9 |

Journal | Graphs and Combinatorics |

Volume | 7 |

Issue number | 4 |

DOIs | |

Publication status | Published - 1991 Dec 1 |

Externally published | Yes |

### ASJC Scopus subject areas

- Theoretical Computer Science
- Discrete Mathematics and Combinatorics

## Fingerprint Dive into the research topics of 'An ore-type condition for the existence of k-factors in graphs'. Together they form a unique fingerprint.

## Cite this

Iida, T., & Nishimura, T. (1991). An ore-type condition for the existence of k-factors in graphs.

*Graphs and Combinatorics*,*7*(4), 353-361. https://doi.org/10.1007/BF01787640