Packing -fold complete multipartite graphs with 4-cycles
From MaRDI portal
Publication:2484153
Recommendations
- Packing complete multipartite graphs with 4-cycles
- Maximum (minimum) almost resolvable \((4,2)\)-cycle packing (covering) of a complete graph
- Some results on 4-cycle packings.
- The Doyen-Wilson theorem for maximum packings of \(K_n\) with 4-cycles
- Almost resolvable maximum packings of complete graphs with 4-cycles
Cited in
(16)- Packings and coverings of the complete directed multigraph with 3- and 4-circuits
- The Doyen-Wilson theorem for maximum packings of \(K_n\) with 4-cycles
- Packings and coverings of various complete graphs with the 4-cycle with a pendant edge
- Maximum cyclic 4-cycle packings of the complete multipartite graph
- Packing 5-cycles into balanced complete \(m\)-partite graphs for odd \(m\)
- Packing complete multipartite graphs with 4-cycles
- Packing and covering -fold complete symmetric digraphs with 6-circuits.
- Some results on 4-cycle packings.
- scientific article; zbMATH DE number 6831075 (Why is no real title available?)
- Nonisomorphic maximum packing and minimum covering of K_v with 8-cycles
- On maximal t-packings of the complete multipartite graph
- Packing 5-cycles into balanced complete n-partite graphs for even n: the 1-factor leave
- Leaves for packings with block size four
- Packings and coverings of lambda-fold line graphs of the complete graph with \(k\)-cycles, for \(k=4,6\)
- Closed trail decompositions of some classes of regular graphs
- Maximum packings and minimum coverings of \(K_{v}\) with octagons
This page was built for publication: Packing \(\lambda\)-fold complete multipartite graphs with 4-cycles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2484153)
