Réductions de graphes et systèmes de Church-Rosser

— In Combinatorial Optimization réduction techniques are often useful. Whenjor a given problem, some choices arise, the order of the réductions may be important for the final resuit. In this paper one shows that Church-Rosser Systems are a good frame for studying this question in the case of digraph problems.