On Vertices of Degree n in Minimally n-Edge-Connected Graphs (Q4844492): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+The number of vertices of degree \(k\) in a minimally \(k\)-edge connected graph
+Normal rank
@@ Property / cites work @@
+A remark on the number of vertices of degree \(k\) in a minimally \(k\)-edge- connected graph
+Normal rank
@@ Property / cites work @@
+Indestructive deletions of edges from graphs
@@ Property / cites work: Indestructive deletions of edges from graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Minimale \(n\)-fach kantenzusammenhängende Graphen
+Normal rank
@@ Property / cites work @@
+A Reduction Method for Edge-Connectivity in Graphs
+Normal rank
@@ Property / cites work @@
+Kantendisjunkte Wege in Graphen
@@ Property / cites work: Kantendisjunkte Wege in Graphen / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1017/s0963548300001498
+Normal rank
@@ Property / OpenAlex ID @@
+W2082823229
@@ Property / OpenAlex ID: W2082823229 / rank @@
+Normal rank

On Vertices of Degree <i>n</i> in Minimally <i>n</i>-Edge-Connected Graphs (Q4844492): Difference between revisions