On the number of disjoint 4-cycles in regular tournaments (Q1708396): Difference between revisions

@@ Property / cites work @@
+Vertex-disjoint cycles in bipartite tournaments
@@ Property / cites work: Vertex-disjoint cycles in bipartite tournaments / rank @@
+Normal rank
@@ Property / cites work @@
+Disjoint 3‐Cycles in Tournaments: A Proof of The Bermond–Thomassen Conjecture for Tournaments
+Normal rank
@@ Property / cites work @@
+Cycles in digraphs– a survey
@@ Property / cites work: Cycles in digraphs– a survey / rank @@
+Normal rank
@@ Property / cites work @@
+Two proofs of the Bermond-Thomassen conjecture for tournaments with bounded minimum in-degree
+Normal rank
@@ Property / cites work @@
+A Step toward the Bermond–Thomassen Conjecture about Disjoint Cycles in Digraphs
+Normal rank
@@ Property / cites work @@
+Vertex-disjoint cycles in regular tournaments
@@ Property / cites work: Vertex-disjoint cycles in regular tournaments / rank @@
+Normal rank
@@ Property / cites work @@
+Vertex-disjoint directed cycles of prescribed length in tournaments with given minimum out-degree and in-degree
+Normal rank
@@ Property / cites work @@
+Disjoint cycles in digraphs
@@ Property / cites work: Disjoint cycles in digraphs / rank @@
+Normal rank