Publications of C. Delorme

1. J.-C. Bermond, C. Delorme, and J-J. Quisquater. Table of large $({\Delta},D)$-graphs. Discrete Applied Mathematics, 37/38:575--577, 1992. [bibtex-entry]


2. J.-C. Bermond, C. Delorme, and J.-J. Quisquater. Strategies for interconnection networks: some methods from graph theory. J. Parallel Distributed Computing, 3(4):433--449, 1986. [WWW ] [bibtex-entry]


3. J.-C. Bermond, C. Delorme, and G. Farhi. Large graphs with given degree and diameter. II. J. Combin. Theory Ser. B, 36(1):32--48, 1984. [bibtex-entry]


4. J.-C. Bermond, C. Delorme, and G. Farhi. Large graphs with given degree and diameter. III. In Graph theory, volume 62 of North-Holland Math. Stud., pages 23--31. North-Holland, Amsterdam, 1982.
   Note: Présenté au Colloque Cambridge, England, 1981. [bibtex-entry]


5. J.-C. Bermond, C. Delorme, and J.-J. Quisquater. Tables of large graphs with given degree and diameter. Inform. Process. Lett., 15(1):10--13, 1982. [bibtex-entry]

1. J.-C. Bermond, C. Delorme, and J.-J. Quisquater. Grands graphes de degré et diamètre fixés. In Combinatorial mathematics (Marseille-Luminy, 1981), volume 75 of North-Holland Math. Stud., Amsterdam, pages 65--73, 1983. North-Holland. [bibtex-entry]

This document was translated from BibT_EX by bibtex2html