A degree sum condition for graphs to be covered by two cycles (Q973109): 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.2010.02.017
+Normal rank
@@ Property / OpenAlex ID @@
+W1984537817
@@ Property / OpenAlex ID: W1984537817 / rank @@
+Normal rank
@@ Property / cites work @@
+Neighborhood unions and the cycle cover number of a graph
+Normal rank
@@ Property / cites work @@
+A note on Hamiltonian circuits
@@ Property / cites work: A note on Hamiltonian circuits / rank @@
+Normal rank
@@ Property / cites work @@
+Degree Sums and Covering Cycles
@@ Property / cites work: Degree Sums and Covering Cycles / rank @@
+Normal rank
@@ Property / cites work @@
+Q3211348
@@ Property / cites work: Q3211348 / rank @@
+Normal rank
@@ Property / cites work @@
+Relative length of long paths and cycles in graphs with large degree sums
+Normal rank
@@ Property / cites work @@
+Long cycles in graphs without Hamiltonian paths
@@ Property / cites work: Long cycles in graphs without Hamiltonian paths / rank @@
+Normal rank
@@ Property / cites work @@
+Cycles in graphs with prescribed stability number and connectivity
+Normal rank
@@ Property / cites work @@
+Hamilton connected graphs
@@ Property / cites work: Hamilton connected graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Degree sums and graphs that are not covered by two cycles
+Normal rank