Resolvable Decomposition of Kn. - Jean-Claude Bermond; Anne Germa; Dominique Sotteau (J. Comb. Theory A, 1979)

Girth in digraphs. - Jean-Claude Bermond; Anne Germa; Marie-Claude Heydemann; Dominique Sotteau (J. Graph Theory, 1980)

Longest paths in digraphs. - Jean-Claude Bermond; Anne Germa; Marie-Claude Heydemann; Dominique Sotteau (Comb., 1981)

Hamiltonian pancyclic graphs. - Denise Amar; Evelyne Flandrin; Irène Fournier; Anne Germa (Discret. Math., 1983)

Covering the vertices of a graph by cycles of prescribed length. - Denise Amar; Irène Fournier; Anne Germa (J. Graph Theory, 1989)

Pancyclism in hamiltonian graphs. - Denise Amar; Evelyne Flandrin; Irène Fournier; Anne Germa (Discret. Math., 1991)

Pancyclism in Chvátal-Erdös's graphs. - Denise Amar; Irène Fournier; Anne Germa (Graphs Comb., 1991)

Emulating Networks by Bus Networks: Application to Trees and Hypermeshes. - Dominique Barth; Anne Germa; Marie-Claude Heydemann; Dominique Sotteau (SIROCCO, 1996)

Cycles in the cube-connected cycles graph. - Anne Germa; Marie-Claude Heydemann; Dominique Sotteau (Discret. Appl. Math., 1998)