Marie-Claude Heydemann

Discret. Appl. Math., 2002

2001

Efficient reconfiguration algorithms of de Bruijn and Kautz networks into linear arrays.

[BibT_eX]

[DOI]

Rabah Harbane

Theor. Comput. Sci., 2001

Complete Rotations in Cayley Graphs.

[BibT_eX]

[DOI]

Nausica Marlin

Stéphane Pérennes

Eur. J. Comb., 2001

2000

Rotational Cayley Graphs on Transposition Generated Groups.

[BibT_eX]

[DOI]

Nausica Marlin

Stéphane Pérennes

Electron. Notes Discret. Math., 2000

1998

Embedding Complete Binary Trees Into Star and Pancake Graphs.

[BibT_eX]

[DOI]

Abdelmadjid Bouabdallah

Theory Comput. Syst., 1998

Uniform homomorphisms of de Bruijn and Kautz networks.

[BibT_eX]

[DOI]

Pavel Tvrdík

Rabah Harbane

Discret. Appl. Math., 1998

Cycles in the cube-connected cycles graph.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1998

1997

A New Digraphs Composition with Applications to De Bruijn and Generalized De Bruijn Digraphs.

[BibT_eX]

[DOI]

Dominique Barth

Discret. Appl. Math., 1997

1996

Spanners of Hypercube-Derived Networks.

[BibT_eX]

[DOI]

Joseph G. Peters

SIAM J. Discret. Math., 1996

Embeddings of Complete Binary Trees into Extended Grids with Edge-congestion 1*.

[BibT_eX]

[DOI]

Parallel Algorithms Appl., 1996

Emulating Networks by Bus Networks: Application to Trees and Hypermeshes.

[BibT_eX]

Dominique Barth

Proceedings of the SIROCCO'96, 1996

1995

A Note on Recursive Properties of the de Bruijn, Kautz and FFT Digraphs.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1995

Embeddings of complete binary trees into star graphs with congestion 1.

[BibT_eX]

[DOI]

Proceedings of the 28th Annual Hawaii International Conference on System Sciences (HICSS-28), 1995

1994

Forwarding indices of consistent routings and their complexity.

[BibT_eX]

[DOI]

Networks, 1994

Embeddings of Hypercubes and Grids into de Bruijn Graphs.

[BibT_eX]

[DOI]

J. Parallel Distributed Comput., 1994

Embedding Complete Binary Trees into Star Networks.

[BibT_eX]

[DOI]

Abdelmadjid Bouabdallah

Proceedings of the Mathematical Foundations of Computer Science 1994, 1994

1992

Broadcasting and Spanning Trees in de Bruijn and Kautz Networks.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1992

Forwarding Indices of <i>k</i>-Connected Graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1992

1991

Embeddings of Shuffle-Like Graphs in Hyphercubes.

[BibT_eX]

[DOI]

Marc Baumslag

Proceedings of the PARLE '91: Parallel Architectures and Languages Europe, 1991

1990

A parameter linked with G-factors and the binding number.

[BibT_eX]

[DOI]

Odile Favaron

Discret. Math., 1990

1989

On forwarding indices of networks.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1989

1985

About some cyclic properties in digraphs.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. B, 1985

1984

Number of arcs and cycles in digraphs.

[BibT_eX]

[DOI]

Discret. Math., 1984

1982

Degrees and cycles in digraphs.

[BibT_eX]

[DOI]

Discret. Math., 1982

Cycles in strong oriented graphs.

[BibT_eX]

[DOI]

Discret. Math., 1982

1981

Longest paths in digraphs.

[BibT_eX]

[DOI]

Jean-Claude Bermond

Comb., 1981

1980

Girth in digraphs.

[BibT_eX]

[DOI]

Jean-Claude Bermond

J. Graph Theory, 1980

On cycles and paths in digraphs.

[BibT_eX]

[DOI]

Discret. Math., 1980

1978

Spectral characterization of some graphs.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. B, 1978

1977

Line graphs of hypergraphs I.

[BibT_eX]

[DOI]

Jean-Claude Bermond