### 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 |

Externally published | Yes |

### Fingerprint

### ASJC Scopus subject areas

- Discrete Mathematics and Combinatorics
- Mathematics(all)

### Cite this

*Graphs and Combinatorics*,

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

**An ore-type condition for the existence of k-factors in graphs.** / Iida, Tadashi; Nishimura, Tsuyoshi.

Research output: Contribution to journal › Article

*Graphs and Combinatorics*, vol. 7, no. 4, pp. 353-361. https://doi.org/10.1007/BF01787640

}

TY - JOUR

T1 - An ore-type condition for the existence of k-factors in graphs

AU - Iida, Tadashi

AU - Nishimura, Tsuyoshi

PY - 1991/12

Y1 - 1991/12

N2 - 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.

AB - 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.

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

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

U2 - 10.1007/BF01787640

DO - 10.1007/BF01787640

M3 - Article

VL - 7

SP - 353

EP - 361

JO - Graphs and Combinatorics

JF - Graphs and Combinatorics

SN - 0911-0119

IS - 4

ER -