On two-connected subgraph polytopes

DOI10.1016/0012-365X(94)00255-HzbMath0838.05085MaRDI QIDQ1910503

Francisco Barahona, Ali Ridha Mahjoub

Publication date: 24 March 1996

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

partition inequalities; wheel inequalities; polytope for Halin graphs; subgraph polytopes

Mathematics Subject Classification ID

05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)

Related Items

On the dominant of the Steiner 2-edge connected subgraph polytope, Design of survivable IP-over-optical networks, Two-edge connected spanning subgraphs and polyhedra, On perfectly two-edge connected graphs, The \(k\)-edge connected subgraph problem. I: Polytopes and critical extreme points., On survivable network polyhedra, The node-edge weighted 2-edge connected subgraph problem: linear relaxation, facets and separation, \(k\)-edge connected polyhedra on series-parallel graphs, The 2-edge-connected subgraph polyhedron, Critical extreme points of the 2-edge connected spanning subgraph polytope, Two-edge connected subgraphs with bounded rings: Polyhedral results and branch-and-cut, On the Steiner 2-edge connected subgraph polytope

Cites Work

• Unnamed Item
• Unnamed Item
• Minimum-weight two-connected spanning networks
• On the spanning tree polyhedron
• Separating from the dominant of the spanning tree polytope
• Two-edge connected spanning subgraphs and polyhedra
• The dominant of the 2-connected-Steiner-subgraph polytope for \(W_ 4\)-free graphs
• Edge-Disjoint Spanning Trees of Finite Graphs
• Optimal attack and reinforcement of a network
• Odd Minimum Cut-Sets and b-Matchings
• Computational Results with a Cutting Plane Algorithm for Designing Communication Networks with Low-Connectivity Constraints
• Facets for Polyhedra Arising in the Design of Communication Networks with Low-Connectivity Constraints
• Polyhedra of the Equivalent Subgraph Problem and Some Edge Connectivity Problems
• The k-Edge-Connected Spanning Subgraph Polyhedron
• Halin graphs and the travelling salesman problem
• Maximum matching and a polyhedron with 0,1-vertices