Abstract
In this paper, we study a composition (decomposition) technique for the triangle-free subgraph polytope in graphs which are decomposable by means of 3-sums satisfying some property. If a graph G decomposes into two graphs G 1 and G 2, we show that the triangle-free subgraph polytope of G can be described from two linear systems related to G 1 and G 2. This gives a way to characterize this polytope on graphs that can be recursively decomposed. This also gives a procedure to derive new facets for this polytope. We also show that, if the systems associated with G 1 and G 2 are TDI, then the system characterizing the polytope for G is TDI. This generalizes previous results in R. Euler and A.R. Mahjoub (Journal of Comb. Theory series B, vol. 53, no. 2, pp. 235–259, 1991) and A.R. Mahjoub (Discrete Applied Math., vol. 62, pp. 209–219, 1995).
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
E. Balas, V. Chvatal, and J. Nesetril, “On the maximum weight clique problem,” Math. Oper. Res., vol. 12, pp. 522–535, 1987.
F. Barahona, “The max cut problem in graphs non contractible to K 5,” Oper. Res. Lett., vol. 2, pp. 107–111, 1983.
F. Barahona, J. Fonlupt, and A.R. Mahjoub, “Composition of graphs and Polyhedra IV: Acyclic spanning sub graphs,” SIAM J. Discrete Math., vol. 7, no. 3, pp. 390–402, 1994.
M. Bouchakour and A.R. Mahjoub, “One-node cutsets and the dominating set poly tope,” Discrete Math., vol. 165/166, pp. 101–123, 1997.
M. Burlet and J. Fonlupt, “Polyhedral consequences of the amalgam operation,” Discrete Math., vol. 130, pp. 39–55, 1995.
M. Conforti, D.G. Corneil, and A.R. Mahjoub, “K i-cover I: Complexity and poly topes,” Discrete Math., vol. 58, pp. 121–142, 1986.
R. Euler and A.R. Mahjoub, “On a composition of independence systems by circuit identification,” Journal of Comb. Theory series B, vol. 53, no. 2, pp. 235–259, 1991.
J. Fonlupt, A.R. Mahjoub, and J.P. Uhry, “Compositions in the bipartite sub graph poly tope,” Discrete Math., vol. 105, pp. 73–91, 1992.
A. Hadjar, “Composition de polyèdres associés aux problèmes d'optimisation combinatoire,” Ph.D Dissertation, Laboratoire Leibnitz, Institut Polytechnique de Grenoble, Grenoble, France, 1996.
A.R. Mahjoub, “A min-max relation for K 3-covers in graphs noncontractible to K 5\e,” Discrete Applied Math., vol. 62, pp. 209–219, 1995.
F. Margot, “Composition de polytopes combinatoires: une approche par projection,” Ph.D Dissertation, Ecole Polytechnique Fédérale de Lausanne, Swizerland, 1994.
W.R. Pulleyblank, “Polyedral combinatorics,” in Handbook in OR and MS, vol. 1, G.L. Nemhauser et al. (Eds.), Elsevier Science Publishers B.V.: North-Holland, Amsterdam, 1989.
M. Yannakakis, “Edge-deletion problems,” SIAM J. Comput., vol. 10, pp. 297–309, 1981.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Bendali, F., Mahjoub, A. & Mailfert, J. Composition of Graphs and the Triangle-Free Subgraph Polytope. Journal of Combinatorial Optimization 6, 359–381 (2002). https://doi.org/10.1023/A:1019518830361
Issue Date:
DOI: https://doi.org/10.1023/A:1019518830361