Independence number, connectivity, and r‐factors

Research output: Contribution to journalArticle

16 Citations (Scopus)

Abstract

We show that if r ⩾ 1 is an odd integer and G is a graph with |V(G)| even such that k(G) ⩾ (r + 1)2/2 and (r + 1)2α(G) ⩽ 4rk(G), then G has an r‐factor; if r ⩾ 2 is even and G is a graph with k(G) ⩾ r(r + 2)/2 and (r + 2)α(G) ⩽ 4k(G), then G has an r‐factor (where k(G) and α(G) denote the connectivity and the independence number of G, respectively).

Original languageEnglish
Pages (from-to)63-69
Number of pages7
JournalJournal of Graph Theory
Volume13
Issue number1
DOIs
Publication statusPublished - 1989 Jan 1
Externally publishedYes

ASJC Scopus subject areas

  • Geometry and Topology

Cite this

Independence number, connectivity, and r‐factors. / Nishimura, Tsuyoshi.

In: Journal of Graph Theory, Vol. 13, No. 1, 01.01.1989, p. 63-69.

Research output: Contribution to journalArticle

@article{b708e03414ea45d4beb142bdc915227e,
title = "Independence number, connectivity, and r‐factors",
abstract = "We show that if r ⩾ 1 is an odd integer and G is a graph with |V(G)| even such that k(G) ⩾ (r + 1)2/2 and (r + 1)2α(G) ⩽ 4rk(G), then G has an r‐factor; if r ⩾ 2 is even and G is a graph with k(G) ⩾ r(r + 2)/2 and (r + 2)α(G) ⩽ 4k(G), then G has an r‐factor (where k(G) and α(G) denote the connectivity and the independence number of G, respectively).",
author = "Tsuyoshi Nishimura",
year = "1989",
month = "1",
day = "1",
doi = "10.1002/jgt.3190130109",
language = "English",
volume = "13",
pages = "63--69",
journal = "Journal of Graph Theory",
issn = "0364-9024",
publisher = "Wiley-Liss Inc.",
number = "1",

}

TY - JOUR

T1 - Independence number, connectivity, and r‐factors

AU - Nishimura, Tsuyoshi

PY - 1989/1/1

Y1 - 1989/1/1

N2 - We show that if r ⩾ 1 is an odd integer and G is a graph with |V(G)| even such that k(G) ⩾ (r + 1)2/2 and (r + 1)2α(G) ⩽ 4rk(G), then G has an r‐factor; if r ⩾ 2 is even and G is a graph with k(G) ⩾ r(r + 2)/2 and (r + 2)α(G) ⩽ 4k(G), then G has an r‐factor (where k(G) and α(G) denote the connectivity and the independence number of G, respectively).

AB - We show that if r ⩾ 1 is an odd integer and G is a graph with |V(G)| even such that k(G) ⩾ (r + 1)2/2 and (r + 1)2α(G) ⩽ 4rk(G), then G has an r‐factor; if r ⩾ 2 is even and G is a graph with k(G) ⩾ r(r + 2)/2 and (r + 2)α(G) ⩽ 4k(G), then G has an r‐factor (where k(G) and α(G) denote the connectivity and the independence number of G, respectively).

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

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

U2 - 10.1002/jgt.3190130109

DO - 10.1002/jgt.3190130109

M3 - Article

VL - 13

SP - 63

EP - 69

JO - Journal of Graph Theory

JF - Journal of Graph Theory

SN - 0364-9024

IS - 1

ER -