A degree condition for the existence of k‐factors

Research output: Contribution to journalArticle

35 Citations (Scopus)

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

ASJC Scopus subject areas

  • Geometry and Topology

Cite this

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

In: Journal of Graph Theory, Vol. 16, No. 2, 01.01.1992, p. 141-151.

Research output: Contribution to journalArticle

@article{073e05d9b4dc41cf80e586da76a2f4b5,
title = "A degree condition for the existence of k‐factors",
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.",
author = "Tsuyoshi Nishimura",
year = "1992",
month = "1",
day = "1",
doi = "10.1002/jgt.3190160205",
language = "English",
volume = "16",
pages = "141--151",
journal = "Journal of Graph Theory",
issn = "0364-9024",
publisher = "Wiley-Liss Inc.",
number = "2",

}

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

VL - 16

SP - 141

EP - 151

JO - Journal of Graph Theory

JF - Journal of Graph Theory

SN - 0364-9024

IS - 2

ER -