Degree sum and connectivity conditions for dominating cycles (Q2477385): 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.2007.04.019
+Normal rank
@@ Property / OpenAlex ID @@
+W2090130267
@@ Property / OpenAlex ID: W2090130267 / rank @@
+Normal rank
@@ Property / cites work @@
+A generalization of a result of Häggkvist and Nicoghossian
+Normal rank
@@ Property / cites work @@
+Longest Cycles in 2-Connected Graphs with Prescribed Maximum Degree
+Normal rank
@@ Property / cites work @@
+Q4350166
@@ Property / cites work: Q4350166 / rank @@
+Normal rank
@@ Property / cites work @@
+A remark on Hamiltonian cycles
@@ Property / cites work: A remark on Hamiltonian cycles / rank @@
+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 @@
+Q3335818
@@ Property / cites work: Q3335818 / rank @@
+Normal rank
@@ Property / cites work @@
+Note on Hamilton Circuits
@@ Property / cites work: Note on Hamilton Circuits / rank @@
+Normal rank
@@ Property / cites work @@
+Degree sums, connectivity and dominating cycles in graphs
+Normal rank