# A neighborhood condition for graphs to have [a, b]-factors II

4 被引用数 (Scopus)

## 抄録

Let a, b, m, and t be integers such that 1 ≤ a < b and 1 ≤ t ≤ [(b - m + 1)/a]. Suppose that G is a graph of order |G| and H is any subgraph of G with the size |E(H)| = m. Then we prove that G has an [a, b]-factor containing all the edges of H if the minimum degree is at least a, |G| > ((a + b)(t(a + b - 1) - 1) + 2m)/b, and |NG(x1) ∪... ∪NG(xt)| ≥ (a|G| + 2m)/(a + b) for every independent set {x1,..., xt} ⊆ V (G). This result is best possible in some sense and it is an extension of the result of H. Matsuda (A neighborhood condition for graphs to have [a, b]-factors, Discrete Mathematics 224 (2000) 289-292).

本文言語 English 763-768 6 Graphs and Combinatorics 18 4 https://doi.org/10.1007/s003730200062 Published - 2002 はい

## ASJC Scopus subject areas

• 理論的コンピュータサイエンス
• 離散数学と組合せ数学

## フィンガープリント

「A neighborhood condition for graphs to have [a, b]-factors II」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。