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

研究成果: Article

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
DOI
出版物ステータスPublished - 2006 4 28

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Discrete Mathematics and Combinatorics

フィンガープリント Fan-type results for the existence of [ a, b ]-factors' の研究トピックを掘り下げます。これらはともに一意のフィンガープリントを構成します。

  • これを引用