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

Tadashi Iida, Tsuyoshi Nishimura

Research output: Contribution to journalArticle

27 Citations (Scopus)

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 languageEnglish
Pages (from-to)353-361
Number of pages9
JournalGraphs and Combinatorics
Volume7
Issue number4
DOIs
Publication statusPublished - 1991 Dec 1

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