Decomposition of Complete Bipartite Graphs into Cycles of Distinct Even Lengths

被引：4
|
作者：
Fu, Chin-Mei [1 ]
Huang, Kuo-Ching [2 ]
Mishima, Miwako [3 ]
机构：
[1] Tamkang Univ, Dept Math, Taipei, Taiwan
[2] Providence Univ, Dept Appl Math, Taichung 43301, Taiwan
[3] Gifu Univ, Dept Elect Elect & Comp Engn, 1-1 Yanagido, Gifu 5011193, Japan
来源：
GRAPHS AND COMBINATORICS | 2016年 / 32卷 / 04期
关键词：
Complete bipartite graph; Cycle decomposition;
D O I：
10.1007/s00373-015-1664-9
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
Let K-n,K- n be the complete bipartite graph with two parts of equal size n. In this paper, it is shown that depending on whether n is even or odd, or , where I is a 1-factor of , can be decomposed into cycles of distinct even lengths for any integer with the exception of n = 4.
引用
收藏
页码：1397 / 1413
页数：17
相关论文
共 50 条
12345