Decomposition of K m,n into 4-cycles and 2t-cycles

Chao-Chih Chou and Chin-Mei Fu ()
Additional contact information
Chao-Chih Chou: John’s University
Chin-Mei Fu: Tamkang University

Journal of Combinatorial Optimization, 2007, vol. 14, issue 2, No 11, 205-218

Abstract: Abstract In this paper we show the sufficient conditions for the decomposition of the complete bipartite graphs K 2m,2n and K 2n+1,2n+1−F into cycles of two different lengths 4 and 2t, t>2, where F is a 1-factor of K 2n+1,2n+1. After that we prove that the results are true for t=5 and 6.

Keywords: Complete bipartite graph; Cycle decomposition (search for similar items in EconPapers)
Date: 2007
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-007-9060-x Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:14:y:2007:i:2:d:10.1007_s10878-007-9060-x

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-007-9060-x

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().