首页 | 本学科首页   官方微博 | 高级检索  
     检索      


Complete-factors and f-factors
Authors:Hikoe Enomoto and Taro Tokuda
Institution:

a Department of Mathematics, Faculty of Science and Technology, Keio University, 3-14-1, Hiyoshi, Kohoku-Ku, Yokohama, 223-8522, Japan

b Department of Information Sciences, College of Science and Engineering, Tokyo Denki University, Ishizaka, Hatoyama, Hiki-gun, Saitama, 350-0394, Japan

Abstract: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)greater-or-equal, slanted2, and f be an integer-valued function defined on V(G) with ∑xset membership, variantV(G)f(x) even. If GV(C) has an f-factor for each component C of F, then G has an f-factor.
Keywords:
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号