The strongest monotone degree condition for \(n\)-connectedness of a graph (Q2560834): 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/0095-8956(74)90058-6
+Normal rank
@@ Property / OpenAlex ID @@
+W1981678905
@@ Property / OpenAlex ID: W1981678905 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5576241
@@ Property / cites work: Q5576241 / rank @@
+Normal rank
@@ Property / cites work @@
+A sufficient condition for             <i>n</i>             ‐connectedness of graphs
+Normal rank
@@ Property / cites work @@
+On Hamilton's ideals
@@ Property / cites work: On Hamilton's ideals / rank @@
+Normal rank
@@ Property / cites work @@
+On the Existence of Graphs with Prescribed Degrees and Connectivity
+Normal rank
@@ Property / cites work @@
+Q5572939
@@ Property / cites work: Q5572939 / rank @@
+Normal rank
@@ Property / cites work @@
+Existence of triconnected graphs with prescribed degrees
+Normal rank
@@ Property / cites work @@
+On the existence of N‐connected graphs with prescribed degrees (n ≧ 2)
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:2560834