Line graphs of hypergraphs I. - Jean-Claude Bermond; Marie-Claude Heydemann; Dominique Sotteau (Discret. Math., 1977)

Spectral characterization of some graphs. - Marie-Claude Heydemann (J. Comb. Theory B, 1978)

On cycles and paths in digraphs. - Marie-Claude Heydemann (Discret. Math., 1980)

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)

Cycles in strong oriented graphs. - Marie-Claude Heydemann (Discret. Math., 1982)

Degrees and cycles in digraphs. - Marie-Claude Heydemann (Discret. Math., 1982)

Number of arcs and cycles in digraphs. - Marie-Claude Heydemann; Dominique Sotteau (Discret. Math., 1984)

About some cyclic properties in digraphs. - Marie-Claude Heydemann; Dominique Sotteau (J. Comb. Theory B, 1985)

On forwarding indices of networks. - Marie-Claude Heydemann; J. C. Meyer; Dominique Sotteau (Discret. Appl. Math., 1989)

A parameter linked with G-factors and the binding number. - Odile Favaron; Marie-Claude Heydemann; J. C. Meyer; Dominique Sotteau (Discret. Math., 1990)

Embeddings of Shuffle-Like Graphs in Hyphercubes. - Marc Baumslag; Marie-Claude Heydemann; Jaroslav Opatrny; Dominique Sotteau (PARLE (1), 1991)

Forwarding Indices of k-Connected Graphs. - Marie-Claude Heydemann; J. C. Meyer; Jaroslav Opatrny; Dominique Sotteau (Discret. Appl. Math., 1992)

Broadcasting and Spanning Trees in de Bruijn and Kautz Networks. - Marie-Claude Heydemann; Jaroslav Opatrny; Dominique Sotteau (Discret. Appl. Math., 1992)

Embedding Complete Binary Trees into Star Networks. - Abdelmadjid Bouabdallah; Marie-Claude Heydemann; Jaroslav Opatrny; Dominique Sotteau (MFCS, 1994)

Embeddings of Hypercubes and Grids into de Bruijn Graphs. - Marie-Claude Heydemann; Jaroslav Opatrny; Dominique Sotteau (J. Parallel Distributed Comput., 1994)

Forwarding indices of consistent routings and their complexity. - Marie-Claude Heydemann; J. C. Meyer; Dominique Sotteau; Jaroslav Opatrny (Networks, 1994)

Embeddings of complete binary trees into star graphs with congestion 1. - Marie-Claude Heydemann; Jaroslav Opatrny; Dominique Sotteau (HICSS (2), 1995)

A Note on Recursive Properties of the de Bruijn, Kautz and FFT Digraphs. - Marie-Claude Heydemann; Dominique Sotteau (Inf. Process. Lett., 1995)

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

Embeddings of Complete Binary Trees into Extended Grids with Edge-congestion 1*. - Marie-Claude Heydemann; Dominique Sotteau; Jaroslav Opatrny (Parallel Algorithms Appl., 1996)

Spanners of Hypercube-Derived Networks. - Marie-Claude Heydemann; Joseph G. Peters; Dominique Sotteau (SIAM J. Discret. Math., 1996)

A New Digraphs Composition with Applications to De Bruijn and Generalized De Bruijn Digraphs. - Dominique Barth; Marie-Claude Heydemann (Discret. Appl. Math., 1997)

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

Uniform homomorphisms of de Bruijn and Kautz networks. - Pavel Tvrdík; Rabah Harbane; Marie-Claude Heydemann (Discret. Appl. Math., 1998)

Embedding Complete Binary Trees Into Star and Pancake Graphs. - Abdelmadjid Bouabdallah; Marie-Claude Heydemann; Jaroslav Opatrny; Dominique Sotteau (Theory Comput. Syst., 1998)

Rotational Cayley Graphs on Transposition Generated Groups. - Marie-Claude Heydemann; Nausica Marlin; Stéphane Pérennes (Electron. Notes Discret. Math., 2000)

Complete Rotations in Cayley Graphs. - Marie-Claude Heydemann; Nausica Marlin; Stéphane Pérennes (Eur. J. Comb., 2001)

Efficient reconfiguration algorithms of de Bruijn and Kautz networks into linear arrays. - Rabah Harbane; Marie-Claude Heydemann (Theor. Comput. Sci., 2001)

Uniform emulations of Cartesian-product and Cayley graphs. - Dominique Barth; Paraskevi Fragopoulou; Marie-Claude Heydemann (Discret. Appl. Math., 2002)