Closed trail decompositions of complete equipartite graphs (Q3578148): Difference between revisions

@@ Property / cites work @@
+Cycle decompositions. IV: Complete directed graphs and fixed length directed cycles
+Normal rank
@@ Property / cites work @@
+Packing Digraphs with Directed Closed Trails
@@ Property / cites work: Packing Digraphs with Directed Closed Trails / rank @@
+Normal rank
@@ Property / cites work @@
+Packing Circuits into <i>K</i><sub><i>N</i></sub>
@@ Property / cites work: Packing Circuits into <i>K</i><sub><i>N</i></sub> / rank @@
+Normal rank
@@ Property / cites work @@
+Q3872478
@@ Property / cites work: Q3872478 / rank @@
+Normal rank
@@ Property / cites work @@
+Decomposing complete tripartite graphs into closed trails of arbitrary lengths
+Normal rank
@@ Property / cites work @@
+Q4267218
@@ Property / cites work: Q4267218 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4221859
@@ Property / cites work: Q4221859 / rank @@
+Normal rank
@@ Property / cites work @@
+Edge partitions of complete multipartite graphs into equal length circuits
+Normal rank
@@ Property / cites work @@
+Balanced incomplete block designs and related designs
+Normal rank
@@ Property / cites work @@
+The Existence and Construction of Balanced Incomplete Block Designs
+Normal rank
@@ Property / cites work @@
+Decomposition of Complete Bipartite Even Graphs into Closed Trails
+Normal rank
@@ Property / cites work @@
+Q5181705
@@ Property / cites work: Q5181705 / rank @@
+Normal rank
@@ Property / cites work @@
+The equipartite Oberwolfach problem with uniform tables
+Normal rank
@@ Property / cites work @@
+Another class of balanced graph designs: Balanced circuit designs
+Normal rank
@@ Property / cites work @@
+On decomposing \(K_n -I\) into cycles of a fixed odd length
+Normal rank
@@ Property / cites work @@
+Decomposing complete equipartite graphs into closed trails of length \(k\)
+Normal rank
@@ Property / cites work @@
+Decomposing complete equipartite graphs into cycles of length2p
+Normal rank
@@ Property / cites work @@
+Decomposition of K//(m,n)(K*//(m,n)) into cycles (circuits) of length 2k
+Normal rank
@@ Property / cites work @@
+Maximal consistent families of triples
@@ Property / cites work: Maximal consistent families of triples / rank @@
+Normal rank
@@ Property / cites work @@
+Decomposition of a complete multigraph into simple paths: nonbalanced handcuffed designs
+Normal rank