Decomposition of K_m,n into short cycles
From MaRDI portal
Publication:1292828
DOI10.1016/S0012-365X(99)90063-8zbMATH Open0934.05106MaRDI QIDQ1292828FDOQ1292828
Chin-Mei Fu, Chao-Chih Chou, Wen-Chung Huang
Publication date: 10 April 2000
Published in: Discrete Mathematics (Search for Journal in Brave)
Recommendations
Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
Cited In (17)
- GENERALISATIONS OF THE DOYEN–WILSON THEOREM
- Decomposing \(K_{u + w} - K_u\) into cycles of prescribed lengths
- Decomposition of complete bipartite graphs into paths and cycles
- Decomposing various graphs into short even-length cycles
- Title not available (Why is that?)
- Encryption and decryption using decomposition of complete graph \(K_{3(6n+1)}\)
- Title not available (Why is that?)
- Decomposition of complete bipartite multigraphs into paths and cycles having \(k\) edges
- Decompositions of some classes of dense graphs into cycles of lengths 4 and 8
- Decomposition of the tensor product of complete graphs into cycles of lengths 3 and 6
- Decomposition of complete bipartite graphs into cycles of distinct even lengths
- A novel approach for cyclic decompositions of balanced complete bipartite graphs into infinite graph classes
- Decomposition of product graphs into paths and cycles of length four
- Decomposing complete equipartite multigraphs into cycles of variable lengths: the amalgamation-detachment approach
- Title not available (Why is that?)
- Packings and Coverings of the Complete Bipartite Graph by Octagons
- Decompostion of \(2K_{m,n}\) into short cycles
This page was built for publication: Decomposition of \(K_{m,n}\) into short cycles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1292828)