Neighborhood conditions and k-Factors

Tadashi Iida, Tsuyoshi Nishimura

Research output: Contribution to journalArticle

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)

Cite this

Neighborhood conditions and k-Factors. / Iida, Tadashi; Nishimura, Tsuyoshi.

In: Tokyo Journal of Mathematics, Vol. 20, No. 2, 01.01.1997, p. 411-418.

Research output: Contribution to journalArticle

Iida, Tadashi ; Nishimura, Tsuyoshi. / Neighborhood conditions and k-Factors. In: Tokyo Journal of Mathematics. 1997 ; Vol. 20, No. 2. pp. 411-418.
@article{71532317b5494f548de3fa3a6fd9717f,
title = "Neighborhood conditions and k-Factors",
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.",
author = "Tadashi Iida and Tsuyoshi Nishimura",
year = "1997",
month = "1",
day = "1",
doi = "10.3836/tjm/1270042114",
language = "English",
volume = "20",
pages = "411--418",
journal = "Tokyo Journal of Mathematics",
issn = "0387-3870",
publisher = "Publication Committee for the Tokyo Journal of Mathematics",
number = "2",

}

TY - JOUR

T1 - Neighborhood conditions and k-Factors

AU - Iida, Tadashi

AU - Nishimura, Tsuyoshi

PY - 1997/1/1

Y1 - 1997/1/1

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

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

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

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

U2 - 10.3836/tjm/1270042114

DO - 10.3836/tjm/1270042114

M3 - Article

AN - SCOPUS:0012910313

VL - 20

SP - 411

EP - 418

JO - Tokyo Journal of Mathematics

JF - Tokyo Journal of Mathematics

SN - 0387-3870

IS - 2

ER -