Contribution des structures algébriques ordonnées à la théorie des réseaux. - Claude Benzaken (1968)

Post's closed systems and the weak chromatic number of hypergraphs. - Claude Benzaken (Discret. Math., 1978)

Critical hypergraphs for the weak chromatic number. - Claude Benzaken (J. Comb. Theory B, 1980)

Complexity of Graph Embeddability Problems. - Claude Benzaken; Stephane Foldes (Theor. Comput. Sci., 1981)

Boolean techniques for matroidal decomposition of independence systems and applications to graphs. - Claude Benzaken; Peter L. Hammer (Discret. Math., 1985)

Split graphs of Dilworth number 2. - Claude Benzaken; Peter L. Hammer; Dominique de Werra (Discret. Math., 1985)

Threshold characterization of graphs with dilworth number two. - Claude Benzaken; Peter L. Hammer; Dominique de Werra (J. Graph Theory, 1985)

More characterizations of triangulated graphs. - Claude Benzaken; Yves Crama; Pierre Duchet; Peter L. Hammer; Frédéric Maffray (J. Graph Theory, 1990)

From Logical Gates Synthesis to Chromatic Bicritical Clutters. - Claude Benzaken (Discret. Appl. Math., 1999)

Hajós' theorem for list colorings of hypergraphs. - Claude Benzaken; Sylvain Gravier; Riste Skrekovski (Discuss. Math. Graph Theory, 2003)