Decomposition of k*n into circuits of odd length. - Dominique Sotteau (Discret. Math., 1976)

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

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)

Almost resolvable decomposition of Kn*. - Frank E. Bennett; Dominique Sotteau (J. Comb. Theory B, 1981)

Decomposition of Km, n(Km, n*) into cycles (circuits) of length 2k. - Dominique Sotteau (J. Comb. Theory B, 1981)

Short cycles in mediate graphs. - Gena Hahn; Dominique Sotteau; H. Sun (Discret. Math., 1983)

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)

Digraphs without directed path of length two or three. - Dominique Sotteau; A. Pawel Wojda (Discret. Math., 1986)

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

On the existence of a matching orthogonal to a 2-factorization. - Mekkia Kouider; Dominique Sotteau (Discret. 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)

Symmetric routings of the hypercube. - Jean-Claude König; Dominique Sotteau (Discret. Math., 1993)

On the edge forwarding index problem for small graphs. - Abdelmadjid Bouabdallah; Dominique Sotteau (Networks, 1993)

Open Problems. - Pierre Fraigniaud; Arthur L. Liestman; Dominique Sotteau (Parallel Process. Lett., 1993)

Communications in Bus Networks. - André Hily; Dominique Sotteau (Canada-France Conference on Parallel and Distributed Computing, 1994)

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)

2-diameter of de Bruijn graphs. - Qiao Li; Dominique Sotteau; Junming Xu 001 (Networks, 1996)

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

Gossiping in d-Dimensional Mesh-Bus Networks. - André Hily; Dominique Sotteau (Parallel Process. Lett., 1996)

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

DCC Linear Congruential Graphs: A New Class of Interconnection Networks. - Jaroslav Opatrny; Dominique Sotteau; N. Srinivasan; Krishnaiyan Thulasiraman (IEEE Trans. Computers, 1996)

Edge Disjoint Graph Spanners of Complete Graphs and Complete Digraphs. - Christian Laforest; Arthur L. Liestman; Thomas C. Shermer; Dominique Sotteau (HICSS (1), 1997)

Cycles in the cube-connected cycles graph. - Anne Germa; Marie-Claude Heydemann; Dominique Sotteau (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)

All-to-All Optical Routing in Optimal Chordal Rings of Degree Four. - Lata Narayanan; Jaroslav Opatrny; Dominique Sotteau (SODA, 1999)

Edge-disjoint spanners of complete graphs and complete digraphs. - Christian Laforest; Arthur L. Liestman; David Peleg; Thomas C. Shermer; Dominique Sotteau (Discret. Math., 1999)

Embeddings of Complete Binary Trees into Grids and Extended Grids with Total Vertex-congestion 1. - Jaroslav Opatrny; Dominique Sotteau (Discret. Appl. Math., 2000)

All-to-All Optical Routing in Chordal Rings of Degree 4. - Lata Narayanan; Jaroslav Opatrny; Dominique Sotteau (Algorithmica, 2001)

Edge-disjoint spanners of complete bipartite graphs. - Christian Laforest; Arthur L. Liestman; Thomas C. Shermer; Dominique Sotteau (Discret. Math., 2001)

On the injective chromatic number of graphs. - Gena Hahn; Jan Kratochvíl; Jozef Sirán; Dominique Sotteau (Discret. Math., 2002)