On perfectly two-edge connected graphs (Q1363658): Difference between revisions

@@ Property / cites work @@
+On two-connected subgraph polytopes
@@ Property / cites work: On two-connected subgraph polytopes / rank @@
+Normal rank
@@ Property / cites work @@
+The <i>k</i>-Edge-Connected Spanning Subgraph Polyhedron
+Normal rank
@@ Property / cites work @@
+Q3929516
@@ Property / cites work: Q3929516 / rank @@
+Normal rank
@@ Property / cites work @@
+The traveling salesman problem on a graph and some related integer polyhedra
+Normal rank
@@ Property / cites work @@
+The dominant of the 2-connected-Steiner-subgraph polytope for \(W_ 4\)-free graphs
+Normal rank
@@ Property / cites work @@
+Q5624995
@@ Property / cites work: Q5624995 / rank @@
+Normal rank
@@ Property / cites work @@
+Topology of series-parallel networks
@@ Property / cites work: Topology of series-parallel networks / rank @@
+Normal rank
@@ Property / cites work @@
+Maximum matching and a polyhedron with 0,1-vertices
+Normal rank
@@ Property / cites work @@
+Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
+Normal rank
@@ Property / cites work @@
+Send-and-Split Method for Minimum-Concave-Cost Network Flows
+Normal rank
@@ Property / cites work @@
+The traveling salesman problem in graphs with some excluded minors
+Normal rank
@@ Property / cites work @@
+Maximal Flow Through a Network
@@ Property / cites work: Maximal Flow Through a Network / rank @@
+Normal rank
@@ Property / cites work @@
+On the relationship between the biconnectivity augmentation and traveling salesman problems
+Normal rank
@@ Property / cites work @@
+Survivable networks, linear programming relaxations and the parsimonious property
+Normal rank
@@ Property / cites work @@
+Q3328286
@@ Property / cites work: Q3328286 / rank @@
+Normal rank
@@ Property / cites work @@
+Integer Polyhedra Arising from Certain Network Design Problems with Connectivity Constraints
+Normal rank
@@ Property / cites work @@
+Q4035361
@@ Property / cites work: Q4035361 / rank @@
+Normal rank
@@ Property / cites work @@
+Facets for Polyhedra Arising in the Design of Communication Networks with Low-Connectivity Constraints
+Normal rank
@@ Property / cites work @@
+Computational Results with a Cutting Plane Algorithm for Designing Communication Networks with Low-Connectivity Constraints
+Normal rank
@@ Property / cites work @@
+Q3677509
@@ Property / cites work: Q3677509 / rank @@
+Normal rank
@@ Property / cites work @@
+Two-edge connected spanning subgraphs and polyhedra
+Normal rank
@@ Property / cites work @@
+Minimum-weight two-connected spanning networks
@@ Property / cites work: Minimum-weight two-connected spanning networks / rank @@
+Normal rank
@@ Property / cites work @@
+The traveling salesman problem: An update of research
+Normal rank
@@ Property / cites work @@
+Q4845372
@@ Property / cites work: Q4845372 / rank @@
+Normal rank
@@ Property / cites work @@
+Steiner problem in Halin networks
@@ Property / cites work: Steiner problem in Halin networks / rank @@
+Normal rank
@@ Property / cites work @@
+Generalized steiner problem in series-parallel networks
+Normal rank