Almost resolvable maximum packings of complete graphs with 4-cycles
From MaRDI portal
(Redirected from Publication:659680)
Recommendations
- Maximum (minimum) almost resolvable \((4,2)\)-cycle packing (covering) of a complete graph
- scientific article; zbMATH DE number 5976587
- The Doyen-Wilson theorem for maximum packings of \(K_n\) with 4-cycles
- Maximum packings of \(K_ n\) with copies of \(K_ 4-e\)
- Packing complete multipartite graphs with 4-cycles
Cites work
Cited in
(12)- Maximum packing for perfect four-triple configurations
- On the existence of maximum resolvable (\(K_{4} - e\))-packings
- scientific article; zbMATH DE number 5976587 (Why is no real title available?)
- Packing complete multipartite graphs with 4-cycles
- Almost resolvable maximum packings of complete graphs with 5-cycles
- Maximum (minimum) almost resolvable \((4,2)\)-cycle packing (covering) of a complete graph
- Maximal cyclic 4-cycle packings and minimal cyclic 4-cycle coverings of the complete graph
- Packings and coverings of various complete graphs with the 4-cycle with a pendant edge
- Packing \(\lambda\)-fold complete multipartite graphs with 4-cycles
- Almost resolvable 4-cycle systems
- scientific article; zbMATH DE number 1735724 (Why is no real title available?)
- scientific article; zbMATH DE number 812039 (Why is no real title available?)
This page was built for publication: Almost resolvable maximum packings of complete graphs with 4-cycles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q659680)