Author/Authors :
We further study some known families of valid inequalities for the 2-edge-connected and 2-node-connected subgraph polytopes. For the 2-edge-connected case، نويسنده , , we show that the odd wheel inequalities together with the obvious constraints give a complete description of the polytope for Halin graphs. For 2-node-connected subgraphs، نويسنده , , we show that the inequalities above، نويسنده , , plus the partition inequalities، نويسنده , , describe the polytope for the same class of graphs.، نويسنده ,
