1. Baïou M., Barahona F. and Mahjoub A.R., Separation of partition inequalities,Math. Oper. Res.25(2000) 243–254.
2. Barahona F., Network design using cut inequalities.SIAM. J. Optim.6(1996) 823–837.
3. Chung F.R.K. and Mumford D., Chordal completions of planar graphs.J. Comb. Theor.31(1994) 96–106.
4. Fortz B. and Labbé M., Polyhedral results for two-connected networks with bounded rings.Math. Program., Ser. A93(2002) 27–54.
5. Grötschel M., Monma C.L. and Stoer M., Facets for polyhedra arising in the design of communication with low-connectivity constraints.SIAM J. Optim.2(1992) 474–504.