On the number of heterochromatic trees in nice and beautiful colorings of complete graphs (Q2062897): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W4200034904
@@ Property / OpenAlex ID: W4200034904 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.02905
@@ Property / arXiv ID: 2106.02905 / rank @@
+Normal rank
@@ Property / cites work @@
+Multicolored trees in complete graphs
@@ Property / cites work: Multicolored trees in complete graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Multicolored trees in complete graphs
@@ Property / cites work: Multicolored trees in complete graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q2732627
@@ Property / cites work: Q2732627 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5684698
@@ Property / cites work: Q5684698 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4401957
@@ Property / cites work: Q4401957 / rank @@
+Normal rank
@@ Property / cites work @@
+On the heterochromatic number of hypergraphs associated to geometric graphs and to matroids
+Normal rank
@@ Property / cites work @@
+Q5589124
@@ Property / cites work: Q5589124 / rank @@
+Normal rank
@@ Property / cites work @@
+A necessary and sufficient condition for the existence of a heterochromatic spanning tree in a graph
+Normal rank