Packing 5-cycles into balanced complete \(m\)-partite graphs for odd \(m\)
From MaRDI portal
Publication:2471048
DOI10.1007/s10878-007-9049-5zbMath1133.05076OpenAlexW1988320137MaRDI QIDQ2471048
Chin-Mei Fu, Ming-Hway Huang, Hung-Lin Fu
Publication date: 18 February 2008
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-007-9049-5
Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Packing pentagons into complete graphs: How clumsy can you get?
- Cycle decompositions of \(K_n\) and \(K_n-I\)
- Packing \(\lambda\)-fold complete multipartite graphs with 4-cycles
- Packing complete multipartite graphs with 4-cycles
- Even cycle decompositions of complete graphs minus a 1‐factor
This page was built for publication: Packing 5-cycles into balanced complete \(m\)-partite graphs for odd \(m\)