A degree condition for cycles of maximum length in bipartite digraphs (Q409445): Difference between revisions

@@ Property / DOI @@
-.1016/j.disc.2011.11.032
@@ Property / DOI: 10.1016/j.disc.2011.11.032 / rank @@
-Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W1980634280
@@ Property / OpenAlex ID: W1980634280 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.4973
@@ Property / arXiv ID: 1101.4973 / rank @@
+Normal rank
@@ Property / cites work @@
+Cycles and paths of many lengths in bipartite digraphs
+Normal rank
@@ Property / cites work @@
+Q3941433
@@ Property / cites work: Q3941433 / 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 @@
+A short proof of Meyniel's theorem
@@ Property / cites work: A short proof of Meyniel's theorem / rank @@
+Normal rank
@@ Property / cites work @@
+A sufficient condition for maximum cycles in bipartite digraphs
+Normal rank
@@ Property / cites work @@
+Une condition suffisante d'existence d'un circuit Hamiltonien dans un graphe oriente
+Normal rank
@@ Property / cites work @@
+Q5591387
@@ Property / cites work: Q5591387 / rank @@
+Normal rank
@@ Property / cites work @@
+Sufficient Conditions for Circuits in Graphs<sup>†</sup>
+Normal rank
@@ Property / DOI @@
+.1016/J.DISC.2011.11.032
@@ Property / DOI: 10.1016/J.DISC.2011.11.032 / rank @@
+Normal rank