# Fan-type results for the existence of [ a, b ]-factors

31 引用 (Scopus)

### 抄録

Let 1 ≤ a < b be integers and G a graph of order n sufficiently large for a and b. Then G has an [ a, b ]-factor if the minimum degree is at least a and every pair of vertices distance two apart has cardinality of the neighborhood union at least an / ( a + b ). This lower bound is sharp. As a consequence, we have a Fan-type condition for a graph to have an [ a, b ]-factor.

元の言語 English 688-693 6 Discrete Mathematics 306 7 https://doi.org/10.1016/j.disc.2006.01.018 Published - 2006 4 28 Yes

Fans

### ASJC Scopus subject areas

• Discrete Mathematics and Combinatorics
• Theoretical Computer Science

### これを引用

：: Discrete Mathematics, 巻 306, 番号 7, 28.04.2006, p. 688-693.

@article{6166f5f1fcf84491a070161602eb6572,
title = "Fan-type results for the existence of [ a, b ]-factors",
abstract = "Let 1 ≤ a < b be integers and G a graph of order n sufficiently large for a and b. Then G has an [ a, b ]-factor if the minimum degree is at least a and every pair of vertices distance two apart has cardinality of the neighborhood union at least an / ( a + b ). This lower bound is sharp. As a consequence, we have a Fan-type condition for a graph to have an [ a, b ]-factor.",
keywords = "[ a, b ]-factor, Factor, Fan-type, Graph, Neighborhood union",
author = "Haruhide Matsuda",
year = "2006",
month = "4",
day = "28",
doi = "10.1016/j.disc.2006.01.018",
language = "English",
volume = "306",
pages = "688--693",
journal = "Discrete Mathematics",
issn = "0012-365X",
publisher = "Elsevier",
number = "7",

}

TY - JOUR

T1 - Fan-type results for the existence of [ a, b ]-factors

AU - Matsuda, Haruhide

PY - 2006/4/28

Y1 - 2006/4/28

N2 - Let 1 ≤ a < b be integers and G a graph of order n sufficiently large for a and b. Then G has an [ a, b ]-factor if the minimum degree is at least a and every pair of vertices distance two apart has cardinality of the neighborhood union at least an / ( a + b ). This lower bound is sharp. As a consequence, we have a Fan-type condition for a graph to have an [ a, b ]-factor.

AB - Let 1 ≤ a < b be integers and G a graph of order n sufficiently large for a and b. Then G has an [ a, b ]-factor if the minimum degree is at least a and every pair of vertices distance two apart has cardinality of the neighborhood union at least an / ( a + b ). This lower bound is sharp. As a consequence, we have a Fan-type condition for a graph to have an [ a, b ]-factor.

KW - [ a, b ]-factor

KW - Factor

KW - Fan-type

KW - Graph

KW - Neighborhood union

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

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

U2 - 10.1016/j.disc.2006.01.018

DO - 10.1016/j.disc.2006.01.018

M3 - Article

AN - SCOPUS:33645851025

VL - 306

SP - 688

EP - 693

JO - Discrete Mathematics

JF - Discrete Mathematics

SN - 0012-365X

IS - 7

ER -