Trade-offs among degree, diameter, and number of paths (Q2112655): Difference between revisions

@@ Property / cites work @@
+The \(k\) edge-disjoint 3-hop-constrained paths polytope
+Normal rank
@@ Property / cites work @@
+Approximability of 3- and 4-Hop Bounded Disjoint Paths Problems
+Normal rank
@@ Property / cites work @@
+Asymptotically large (\(\Delta,D\))-graphs
@@ Property / cites work: Asymptotically large (\(\Delta,D\))-graphs / rank @@
+Normal rank
@@ Property / cites work @@
+On the \(k\) edge-disjoint 2-hop-constrained paths polytope
+Normal rank
@@ Property / cites work @@
+On a problem of a. kotzig concerning factorizations of 4‐regular graphs
+Normal rank
@@ Property / cites work @@
+Two node-disjoint hop-constrained survivable network design and polyhedra
+Normal rank
@@ Property / cites work @@
+Q4870158
@@ Property / cites work: Q4870158 / rank @@
+Normal rank
@@ Property / cites work @@
+On Moore Graphs with Diameters 2 and 3
@@ Property / cites work: On Moore Graphs with Diameters 2 and 3 / rank @@
+Normal rank
@@ Property / cites work @@
+Connectivity of Imase and Itoh digraphs
@@ Property / cites work: Connectivity of Imase and Itoh digraphs / rank @@
+Normal rank
@@ Property / cites work @@
+The two-edge connected hop-constrained network design problem: Valid inequalities and branch-and-cut
+Normal rank
@@ Property / cites work @@
+Two Edge-Disjoint Hop-Constrained Paths and Polyhedra
+Normal rank
@@ Property / cites work @@
+Connectivity of Regular Directed Graphs with Small Diameters
+Normal rank
@@ Property / cites work @@
+On the number of edges in a graph with many two-hop disjoint paths
+Normal rank
@@ Property / cites work @@
+Identifying large robust network clusters via new compact formulations of maximum \(k\)-club problems
+Normal rank
@@ Property / cites work @@
+Robustness and Strong Attack Tolerance of Low-Diameter Networks
+Normal rank