A degree sum condition with connectivity for relative length of longest paths and cycles (Q1045188): Difference between revisions

@@ Property / DOI @@
-.1016/j.disc.2009.06.019
@@ Property / DOI: 10.1016/j.disc.2009.06.019 / rank @@
-Normal rank
@@ Property / cites work @@
+A generalization of a result of Häggkvist and Nicoghossian
+Normal rank
@@ Property / cites work @@
+Q4871748
@@ Property / cites work: Q4871748 / rank @@
+Normal rank
@@ Property / cites work @@
+Longest Cycles in 2-Connected Graphs with Prescribed Maximum Degree
+Normal rank
@@ Property / cites work @@
+Relative length of long paths and cycles in graphs with large degree sums
+Normal rank
@@ Property / cites work @@
+Relative length of longest paths and cycles in 3-connected graphs
+Normal rank
@@ Property / cites work @@
+Two sufficient conditions for dominating cycles
@@ Property / cites work: Two sufficient conditions for dominating cycles / rank @@
+Normal rank
@@ Property / cites work @@
+Note on Hamilton Circuits
@@ Property / cites work: Note on Hamilton Circuits / rank @@
+Normal rank
@@ Property / cites work @@
+On relative length of longest paths and cycles
@@ Property / cites work: On relative length of longest paths and cycles / rank @@
+Normal rank
@@ Property / cites work @@
+Degree sums, connectivity and dominating cycles in graphs
+Normal rank
@@ Property / cites work @@
+Degree sum and connectivity conditions for dominating cycles
+Normal rank
@@ Property / DOI @@
+.1016/J.DISC.2009.06.019
@@ Property / DOI: 10.1016/J.DISC.2009.06.019 / rank @@
+Normal rank