Packing 5-cycles into balanced complete \(m\)-partite graphs for odd \(m\) (Q2471048): Difference between revisions

@@ Property / cites work @@
+Cycle decompositions of \(K_n\) and \(K_n-I\)
@@ Property / cites work: Cycle decompositions of \(K_n\) and \(K_n-I\) / rank @@
+Normal rank
@@ Property / cites work @@
+Even cycle decompositions of complete graphs minus a 1‐factor
+Normal rank
@@ Property / cites work @@
+Packing complete multipartite graphs with 4-cycles
+Normal rank
@@ Property / cites work @@
+Packing \(\lambda\)-fold complete multipartite graphs with 4-cycles
+Normal rank
@@ Property / cites work @@
+Q4526648
@@ Property / cites work: Q4526648 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4026150
@@ Property / cites work: Q4026150 / rank @@
+Normal rank
@@ Property / cites work @@
+Packing pentagons into complete graphs: How clumsy can you get?
+Normal rank