On two-connected subgraph polytopes
- 16 December 1995
- journal article
- Published by Elsevier in Discrete Mathematics
- Vol. 147 (1-3) , 19-34
- https://doi.org/10.1016/0012-365x(94)00255-h
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- The k-Edge-Connected Spanning Subgraph PolyhedronSIAM Journal on Discrete Mathematics, 1994
- Two-edge connected spanning subgraphs and polyhedraMathematical Programming, 1994
- Separating from the dominant of the spanning tree polytopeOperations Research Letters, 1992
- Facets for Polyhedra Arising in the Design of Communication Networks with Low-Connectivity ConstraintsSIAM Journal on Optimization, 1992
- Polyhedra of the Equivalent Subgraph Problem and Some Edge Connectivity ProblemsSIAM Journal on Discrete Mathematics, 1992
- Computational Results with a Cutting Plane Algorithm for Designing Communication Networks with Low-Connectivity ConstraintsOperations Research, 1992
- On the spanning tree polyhedronOperations Research Letters, 1989
- Optimal attack and reinforcement of a networkJournal of the ACM, 1985
- Halin graphs and the travelling salesman problemMathematical Programming, 1983
- Maximum matching and a polyhedron with 0,1-verticesJournal of Research of the National Bureau of Standards Section B Mathematics and Mathematical Physics, 1965