Packing 5-cycles into balanced complete m-partite graphs for odd m
From MaRDI portal
Publication:2471048
Recommendations
- Packing 5-cycles into balanced complete n-partite graphs for even n: the 1-factor leave
- Almost resolvable maximum packings of complete graphs with 5-cycles
- A note on packing graphs without cycles of length up to five
- Packing of \(K_{v}\) with certain graphs of five vertices
- Packing and covering the balanced complete bipartite multigraph with cycles and stars
- scientific article; zbMATH DE number 1556758
- On decomposing complete tripartite graphs into 5-cycles
- On Eulerian regular complete 5-partite graphs and a cycle decomposition problem
- Cycle packings of the complete multigraph
- Further decompositions of complete tripartite graphs into 5-cycles
Cites work
- Cycle decompositions of K_n and K_n-I
- Even cycle decompositions of complete graphs minus a 1‐factor
- scientific article; zbMATH DE number 124520 (Why is no real title available?)
- scientific article; zbMATH DE number 1556758 (Why is no real title available?)
- Packing \(\lambda\)-fold complete multipartite graphs with 4-cycles
- Packing complete multipartite graphs with 4-cycles
- Packing pentagons into complete graphs: How clumsy can you get?
Cited in
(4)- Simple minimum (\(K_4 - e\))-coverings of complete multipartite graphs
- Packing 5-cycles into balanced complete n-partite graphs for even n: the 1-factor leave
- scientific article; zbMATH DE number 2192081 (Why is no real title available?)
- Packings and coverings of lambda-fold line graphs of the complete graph with \(k\)-cycles, for \(k=4,6\)
This page was built for publication: Packing 5-cycles into balanced complete \(m\)-partite graphs for odd \(m\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2471048)