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

@@ 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.disc.2009.06.019
+Normal rank
@@ Property / OpenAlex ID @@
+W2069241802
@@ Property / OpenAlex ID: W2069241802 / 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