Notes on a conjecture of Manoussakis concerning Hamilton cycles in digraphs (Q477633): Difference between revisions

@@ Property / cites work @@
+Cycles through large degree vertices in digraphs: A generalization of Meyniel's theorem
+Normal rank
@@ Property / cites work @@
+A short proof of Meyniel's theorem
@@ Property / cites work: A short proof of Meyniel's theorem / rank @@
+Normal rank
@@ Property / cites work @@
+Q3266934
@@ Property / cites work: Q3266934 / rank @@
+Normal rank
@@ Property / cites work @@
+On pancyclic digraphs
@@ Property / cites work: On pancyclic digraphs / rank @@
+Normal rank
@@ Property / cites work @@
+A sufficient condition for cyclability in directed graphs
+Normal rank
@@ Property / cites work @@
+Directed hamiltonian graphs
@@ Property / cites work: Directed hamiltonian graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Une condition suffisante d'existence d'un circuit Hamiltonien dans un graphe oriente
+Normal rank
@@ Property / cites work @@
+Hamiltonian paths in oriented graphs
@@ Property / cites work: Hamiltonian paths in oriented graphs / rank @@
+Normal rank
@@ Property / cites work @@
+An Ore-type condition implying a digraph to be pancyclic
+Normal rank
@@ Property / cites work @@
+Sufficient Conditions for Circuits in Graphs<sup>†</sup>
+Normal rank