On two-connected subgraph polytopes (Q1910503): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Separating from the dominant of the spanning tree polytope
+Normal rank
@@ Property / cites work @@
+On the spanning tree polyhedron
@@ Property / cites work: On the spanning tree polyhedron / rank @@
+Normal rank
@@ Property / cites work @@
+Polyhedra of the Equivalent Subgraph Problem and Some Edge Connectivity Problems
+Normal rank
@@ Property / cites work @@
+The <i>k</i>-Edge-Connected Spanning Subgraph Polyhedron
+Normal rank
@@ Property / cites work @@
+Halin graphs and the travelling salesman problem
@@ Property / cites work: Halin graphs and the travelling salesman problem / rank @@
+Normal rank
@@ Property / cites work @@
+The dominant of the 2-connected-Steiner-subgraph polytope for \(W_ 4\)-free graphs
+Normal rank
@@ Property / cites work @@
+Optimal attack and reinforcement of a network
@@ Property / cites work: Optimal attack and reinforcement of a network / rank @@
+Normal rank
@@ Property / cites work @@
+Maximum matching and a polyhedron with 0,1-vertices
+Normal rank
@@ Property / cites work @@
+Q4035361
@@ Property / cites work: Q4035361 / rank @@
+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 @@
+Facets for Polyhedra Arising in the Design of Communication Networks with Low-Connectivity Constraints
+Normal rank
@@ Property / cites work @@
+Q5622228
@@ Property / cites work: Q5622228 / 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 @@
+Edge-Disjoint Spanning Trees of Finite Graphs
@@ Property / cites work: Edge-Disjoint Spanning Trees of Finite Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Odd Minimum Cut-Sets and <i>b</i>-Matchings
@@ Property / cites work: Odd Minimum Cut-Sets and <i>b</i>-Matchings / rank @@
+Normal rank