### Abstract

Let k be an integer such that ≦, and let G be a connected graph of order n with ≦, kn even, and minimum degree at least k. We prove that if G satisfies max(deg(u), deg(v)) ≦ n/2 for each pair of nonadjacent vertices u, v in G, then G has a k‐factor.

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

Pages (from-to) | 141-151 |

Number of pages | 11 |

Journal | Journal of Graph Theory |

Volume | 16 |

Issue number | 2 |

DOIs | |

Publication status | Published - 1992 Jan 1 |

Externally published | Yes |

### Fingerprint

### ASJC Scopus subject areas

- Geometry and Topology