A degree condition for the existence of k‐factors

Research output: Contribution to journalArticlepeer-review

39 Citations (Scopus)


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 languageEnglish
Pages (from-to)141-151
Number of pages11
JournalJournal of Graph Theory
Issue number2
Publication statusPublished - 1992 Jun
Externally publishedYes

ASJC Scopus subject areas

  • Geometry and Topology


Dive into the research topics of 'A degree condition for the existence of k‐factors'. Together they form a unique fingerprint.

Cite this