Decomposition of Complete Bipartite Graphs into Cycles of Distinct Even Lengths |
| |
| Authors: | Chin-Mei Fu Kuo-Ching Huang Miwako Mishima |
| |
| Institution: | 1.Department of Mathematics,Tamkang University,Taipei,Taiwan, ROC;2.Department of Applied Mathematics,Providence University,Taichung,Taiwan, ROC;3.Department of Electrical, Electronic and Computer Engineering,Gifu University,Gifu,Japan |
| |
| Abstract: | Let \(K_{n,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, \(K_{n,n}\) or \(K_{n,n}-I\), where I is a 1-factor of \(K_{n,n}\), can be decomposed into cycles of distinct even lengths for any integer \(n \ge 2\) with the exception of \(n = 4\). |
| |
| Keywords: | |
| 本文献已被 SpringerLink 等数据库收录！ |
|
