| Article ID: | iaor20043256 |
| Country: | Netherlands |
| Volume: | 31 |
| Issue: | 6 |
| Start Page Number: | 435 |
| End Page Number: | 441 |
| Publication Date: | Nov 2003 |
| Journal: | Operations Research Letters |
| Authors: | Kieffer Yann |
After recalling the main facts of the well-studied modular decomposition theory for graphs, we give the full description of the facets of the polytope of modules of a graph. Features of interest are that the constraints associated to facets are not associated to combinatorial objects, and depend only on the modular decomposition tree of the graph. Because of the recursive structure of that tree, we describe the facet constraints as the set of outputs of a non-deterministic algorithm.