Stability Number and f-Factors in Graphs

详细信息    查看全文

• 作者：Mekkia Kouider (1)
  
• 关键词：Factor ; Stability number ; Connectivity ; Toughness ; Minimum degree
• 刊名：Graphs and Combinatorics
• 出版年：2014
• 出版时间：January 2014
• 年：2014
• 卷：30
• 期：1
• 页码：197-202
• 全文大小：
• 作者单位：Mekkia Kouider (1)
  
  1. LRI, UMR 8623, University Paris-Sud and CNRS, 91405, Orsay cedex, France
  
• ISSN：1435-5914

文摘

Let ${f:V \longrightarrow N}$ be an integer function. An f-factor is a spanning subgraph of a graph G?=?(V,E) whose vertices have degrees defined by f. In this paper, we prove sufficient condition for the existence of a f-factor which involves the stability number, the minimum degree of G or the connectivity of the graph.