Complete-factors and f-factors

详细信息    查看全文

• 作者：Enomoto ; Hikoe ; Tokuda ; Taro
• 刊名：Discrete Mathematics
• 出版年：2000
• 出版时间：June 6, 2000
• 年：2000
• 卷：220
• 期：1-3
• 页码：239-242
• 全文大小：57.9 K

文摘

A factor F of a graph is called a complete-factor if each component of F is complete. Let G be a graph, F be a complete-factor of G with ω(F)2, and f be an integer-valued function defined on V(G) with ∑_xV(G)f(x) even. If G−V(C) has an f-factor for each component C of F, then G has an f-factor.