A Neighborhood Condition for Graphs to Have [a, b]-Factors III

研究成果: Conference contribution

4 被引用数 (Scopus)

抄録

Let a, b, k, and m be positive integers such that 1 ≤a < b and 2 k (b + 1 - m)/a. Let G = (V(G), E(G)) be a graph of order |G|. Suppose that |G| > (a + b)(k(a + b - 1) - 1)/b and |N G (x 1) ∪ N G (x 2)... ∪ N G (xk )| ≥ a|G|/(a + b) for every independent set { x 1, x 2, ..., x k} ⊆ V(G). Then for any subgraph H of G with m edges and δ(G - E(H))≥ a, G has an [a, b]-factor F such that E(H)∩ E(F) = θ. This result is best possible in some sense and it is an extension of the result of Matsuda (Discrete Mathematics 224 (2000) 289-292).

本文言語English
ホスト出版物のタイトルDiscrete Geometry, Combinatorics and Graph Theory 7th China-Japan Conference, CJCDGCGT 2005, Tianjin, China, November 18-20, 2005, Xi'an, China, November 22-24, 2005, Revised Selected Papers
ページ70-78
ページ数9
DOI
出版ステータスPublished - 2007
外部発表はい
イベント7th China-Japan Conference on Discrete Geometry, Combinatorics and Graph Theory, CJCDGCGT 2005 - Xi'an, China
継続期間: 2005 11 222005 11 24

出版物シリーズ

名前Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
4381 LNCS
ISSN(印刷版)0302-9743
ISSN(電子版)1611-3349

Conference

Conference7th China-Japan Conference on Discrete Geometry, Combinatorics and Graph Theory, CJCDGCGT 2005
CountryChina
CityXi'an
Period05/11/2205/11/24

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

フィンガープリント 「A Neighborhood Condition for Graphs to Have [a, b]-Factors III」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル