Neighborhood conditions and k-Factors

Tadashi Iida, Tsuyoshi Nishimura

Research output: Contribution to journalArticlepeer-review

12 Citations (Scopus)

Abstract

Let k be an integer such that k≥2, and let G be a connected graph of order n such that [Math equation] kn is even, and the minimum degree is at least k. We prove that if[Math equation] for each pair of nonadjacent vertices u, v of G, then G has a k-factor.

Original languageEnglish
Pages (from-to)411-418
Number of pages8
JournalTokyo Journal of Mathematics
Volume20
Issue number2
DOIs
Publication statusPublished - 1997 Jan 1

ASJC Scopus subject areas

  • Mathematics(all)

Fingerprint Dive into the research topics of 'Neighborhood conditions and k-Factors'. Together they form a unique fingerprint.

Cite this