Inverse degree and edge-connectivity (Q1043655): Difference between revisions

@@ Property / describes a project that uses @@
+GRAFFITI
@@ Property / describes a project that uses: GRAFFITI / rank @@
+Normal rank
@@ 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.2008.06.041
+Normal rank
@@ Property / OpenAlex ID @@
+W2009473332
@@ Property / OpenAlex ID: W2009473332 / rank @@
+Normal rank
@@ Property / cites work @@
+A Graph-Theoretic Approach to a Communications Problem
+Normal rank
@@ Property / cites work @@
+Q4350166
@@ Property / cites work: Q4350166 / rank @@
+Normal rank
@@ Property / cites work @@
+Diameter and inverse degree
@@ Property / cites work: Diameter and inverse degree / rank @@
+Normal rank
@@ Property / cites work @@
+Q4856632
@@ Property / cites work: Q4856632 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4355069
@@ Property / cites work: Q4355069 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3832606
@@ Property / cites work: Q3832606 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3197865
@@ Property / cites work: Q3197865 / rank @@
+Normal rank
@@ Property / cites work @@
+On super-edge-connected digraphs and bipartite digraphs
+Normal rank
@@ Property / cites work @@
+A sufficient condition for equality of edge-connectivity and minimum degree of a graph
+Normal rank
@@ Property / cites work @@
+Results on the edge-connectivity of graphs
@@ Property / cites work: Results on the edge-connectivity of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4079637
@@ Property / cites work: Q4079637 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3356329
@@ Property / cites work: Q3356329 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3794215
@@ Property / cites work: Q3794215 / rank @@
+Normal rank
@@ Property / cites work @@
+A sufficient condition for equality of arc-connectivity and minimum degree of a digraph
+Normal rank