An implicit degree condition for long cycles in 2-connected graphs (Q1031703): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.aml.2005.12.006
+Normal rank
@@ Property / OpenAlex ID @@
+W2072516474
@@ Property / OpenAlex ID: W2072516474 / rank @@
+Normal rank
@@ Property / cites work @@
+A generalization of Fan's condition for Hamiltonicity, pancyclicity, and Hamiltonian connectedness
+Normal rank
@@ Property / cites work @@
+Q4094891
@@ Property / cites work: Q4094891 / rank @@
+Normal rank
@@ Property / cites work @@
+Large cycles in graphs
@@ Property / cites work: Large cycles in graphs / 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 @@
+A lower bound for the circumference of a graph
@@ Property / cites work: A lower bound for the circumference of a graph / rank @@
+Normal rank
@@ Property / cites work @@
+Q5342985
@@ Property / cites work: Q5342985 / rank @@
+Normal rank
@@ Property / cites work @@
+Implicit-degrees and circumferences
@@ Property / cites work: Implicit-degrees and circumferences / rank @@
+Normal rank