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

@@ Property / DOI @@
-.1016/j.ipl.2014.08.015
@@ Property / DOI: 10.1016/j.ipl.2014.08.015 / rank @@
-Normal rank
@@ Property / author @@
-Bo Ning
@@ Property / author: Bo Ning / rank @@
-Normal rank
@@ Property / author @@
+Bo Ning
@@ Property / author: Bo Ning / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C45
@@ Property / Mathematics Subject Classification ID: 05C45 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C20
@@ Property / Mathematics Subject Classification ID: 05C20 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6378658
@@ Property / zbMATH DE Number: 6378658 / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+combinatorial problems
@@ Property / zbMATH Keywords: combinatorial problems / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+Hamilton cycle
@@ Property / zbMATH Keywords: Hamilton cycle / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+Hamilton path
@@ Property / zbMATH Keywords: Hamilton path / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+digraph
@@ Property / zbMATH Keywords: digraph / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2091157114
@@ Property / OpenAlex ID: W2091157114 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.5013
@@ Property / arXiv ID: 1404.5013 / rank @@
+Normal rank
@@ 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
@@ Property / Wikidata QID @@
+Q122905083
@@ Property / Wikidata QID: Q122905083 / rank @@
+Normal rank
@@ Property / DOI @@
+.1016/J.IPL.2014.08.015
@@ Property / DOI: 10.1016/J.IPL.2014.08.015 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:477633