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


C k -factorization of complete bipartite graphs
Authors:Hikoe Enomoto  Takashi Miyamoto  Kazuhiko Ushio
Institution:(1) Department of Information Science, Faculty of Science, University of Tokyo, 113 Tokyo, Japan;(2) Support System Development Department, Micro Computer Software Development Laboratory, NEC Corporation, Shibaura, Minato-ku, 108 Tokyo, Japan;(3) Department of Industrial Engineering, Faculty of Science and Technology, Kinki University, 577 Osaka, Japan
Abstract:In this paper, it is shown that a necessary and sufficient condition for the existence of aC k-factorization ofK m,n is (i)m = n equiv 0 (mod 2), (ii)k equiv 0 (mod 2),k ge 4 and (iii) 2n equiv 0 (modk) with precisely one exception, namely m =n = k = 6.
Keywords:
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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