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

### ASJC Scopus subject areas

- Geometry and Topology

### Cite this

**A degree condition for the existence of k‐factors.** / Nishimura, Tsuyoshi.

Research output: Contribution to journal › Article

*Journal of Graph Theory*, vol. 16, no. 2, pp. 141-151. https://doi.org/10.1002/jgt.3190160205

}

TY - JOUR

T1 - A degree condition for the existence of k‐factors

AU - Nishimura, Tsuyoshi

PY - 1992/1/1

Y1 - 1992/1/1

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

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

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

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

U2 - 10.1002/jgt.3190160205

DO - 10.1002/jgt.3190160205

M3 - Article

AN - SCOPUS:84987491029

VL - 16

SP - 141

EP - 151

JO - Journal of Graph Theory

JF - Journal of Graph Theory

SN - 0364-9024

IS - 2

ER -