An efficient condition for a graph to be Hamiltonian (Q2383542): Difference between revisions

@@ Property / author @@
-Sheng-Jia Li
@@ Property / author: Sheng-Jia Li / rank @@
-Normal rank
@@ Property / author @@
+Sheng-Jia Li
@@ Property / author: Sheng-Jia Li / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.dam.2007.03.013
+Normal rank
@@ Property / OpenAlex ID @@
+W2021488373
@@ Property / OpenAlex ID: W2021488373 / rank @@
+Normal rank
@@ Property / cites work @@
+The Geng-Hua Fan conditions for pancyclic or Hamilton-connected graphs
+Normal rank
@@ Property / cites work @@
+Q5422499
@@ Property / cites work: Q5422499 / rank @@
+Normal rank
@@ Property / cites work @@
+New sufficient conditions for cycles in graphs
@@ Property / cites work: New sufficient conditions for cycles in graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Updating the hamiltonian problem—A survey
@@ Property / cites work: Updating the hamiltonian problem—A survey / rank @@
+Normal rank
@@ Property / cites work @@
+Advances on the Hamiltonian problem -- a survey
@@ Property / cites work: Advances on the Hamiltonian problem -- a survey / rank @@
+Normal rank
@@ Property / cites work @@
+Note on Hamilton Circuits
@@ Property / cites work: Note on Hamilton Circuits / rank @@
+Normal rank