Decomposing complete equipartite graphs into closed trails of length \(k\) (Q604659): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/s00373-010-0899-8
+Normal rank
@@ Property / OpenAlex ID @@
+W2068528849
@@ Property / OpenAlex ID: W2068528849 / 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 @@
+Decomposing complete tripartite graphs into closed trails of arbitrary lengths
+Normal rank
@@ Property / cites work @@
+Path and cycle decompositions of complete equipartite graphs: 3 and 5 parts
+Normal rank
@@ Property / cites work @@
+Q4256009
@@ Property / cites work: Q4256009 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4222083
@@ Property / cites work: Q4222083 / rank @@
+Normal rank
@@ Property / cites work @@
+Balanced incomplete block designs and related designs
+Normal rank
@@ Property / cites work @@
+Decomposition of Complete Bipartite Even Graphs into Closed Trails
+Normal rank
@@ Property / cites work @@
+Neighbor designs
@@ Property / cites work: Neighbor designs / rank @@
+Normal rank
@@ Property / cites work @@
+Decomposing complete equipartite graphs into cycles of length2p
+Normal rank
@@ Property / cites work @@
+Q3058999
@@ Property / cites work: Q3058999 / rank @@
+Normal rank