Large cycles in 4-connected graphs (Q626774): Difference between revisions

@@ Property / DOI @@
-.1016/j.disc.2010.10.020
@@ Property / DOI: 10.1016/j.disc.2010.10.020 / rank @@
-Normal rank
@@ Property / MaRDI profile type @@
+Publication
@@ Property / MaRDI profile type: Publication / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2079362974
@@ Property / OpenAlex ID: W2079362974 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.5053
@@ Property / arXiv ID: 0906.5053 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5422499
@@ Property / cites work: Q5422499 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3490020
@@ Property / cites work: Q3490020 / rank @@
+Normal rank
@@ Property / cites work @@
+Decomposition of Finite Graphs into Open Chains
@@ Property / cites work: Decomposition of Finite Graphs into Open Chains / rank @@
+Normal rank
@@ Property / cites work @@
+Two sufficient conditions for Hamilton and dominating cycles
+Normal rank
@@ Property / cites work @@
+Degree sums, connectivity and dominating cycles in graphs
+Normal rank
@@ Property / cites work @@
+Q4141844
@@ Property / cites work: Q4141844 / rank @@
+Normal rank
@@ Property / cites work @@
+A degree sum condition with connectivity for relative length of longest paths and cycles
+Normal rank
@@ Property / DOI @@
+.1016/J.DISC.2010.10.020
@@ Property / DOI: 10.1016/J.DISC.2010.10.020 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:626774