Cycles in a tournament with pairwise zero, one or two given vertices in common (Q2470442): Difference between revisions

@@ Property / DOI @@
-.1016/j.disc.2007.07.018
@@ Property / DOI: 10.1016/j.disc.2007.07.018 / rank @@
-Normal rank
@@ Property / cites work @@
+Q4539516
@@ Property / cites work: Q4539516 / rank @@
+Normal rank
@@ Property / cites work @@
+Cycles in digraphs– a survey
@@ Property / cites work: Cycles in digraphs– a survey / rank @@
+Normal rank
@@ Property / cites work @@
+Q3267901
@@ Property / cites work: Q3267901 / rank @@
+Normal rank
@@ Property / cites work @@
+Partitioning vertices of a tournament into independent cycles
+Normal rank
@@ Property / cites work @@
+Q4756732
@@ Property / cites work: Q4756732 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3691764
@@ Property / cites work: Q3691764 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4294624
@@ Property / cites work: Q4294624 / rank @@
+Normal rank
@@ Property / cites work @@
+Hamiltonian-connected tournaments
@@ Property / cites work: Hamiltonian-connected tournaments / rank @@
+Normal rank
@@ Property / DOI @@
+.1016/J.DISC.2007.07.018
@@ Property / DOI: 10.1016/J.DISC.2007.07.018 / rank @@
+Normal rank