About the number of directed paths in tournaments (Q2306588): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.dam.2019.09.005
+Normal rank
@@ Property / OpenAlex ID @@
+W2978089393
@@ Property / OpenAlex ID: W2978089393 / rank @@
+Normal rank
@@ Property / cites work @@
+The maximum number of Hamiltonian paths in tournaments
+Normal rank
@@ Property / cites work @@
+A note on the number of Hamiltonian paths in strong tournaments
+Normal rank
@@ Property / cites work @@
+Q3267901
@@ Property / cites work: Q3267901 / rank @@
+Normal rank
@@ Property / cites work @@
+Catalan’s Conjecture: Another old Diophantine problem solved
+Normal rank
@@ Property / cites work @@
+Q5677515
@@ Property / cites work: Q5677515 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3595115
@@ Property / cites work: Q3595115 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4756732
@@ Property / cites work: Q4756732 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4555322
@@ Property / cites work: Q4555322 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5837980
@@ Property / cites work: Q5837980 / rank @@
+Normal rank
@@ Property / cites work @@
+On the number of Hamiltonian cycles in tournaments
+Normal rank
@@ Property / Wikidata QID @@
+Q127184430
@@ Property / Wikidata QID: Q127184430 / rank @@
+Normal rank