Résumé en anglais

In this paper, we study the dominating set polytope in the class of graphs that decompose by one-node cutsets where the pieces are cycles. We describe some classes of facets and procedures to construct facets of the polytope in that class of graphs, and establish some structural properties. As a consequence we obtain a complete description of the polytope by a system of inequalities when the graph is a cycle. We also show that the separation problem related to that system can be solved in polynomial time. This yields a polynomial time cutting plane algorithm for the minimum weight dominating set problem in that case. We further discuss the applications for the class of cactus graphs.