| Distributed loop computer-networks: a survey JC Bermond, F Comellas, DF Hsu Journal of parallel and distributed computing 24 (1), 2-10, 1995 | 587 | 1995 |
| De Bruijn and Kautz networks: a competitor for the hypercube? JC Bermond, C Peyrat First European Workshop on Hypercube and Distributed Computers, pp 279-283, 1989 | 287 | 1989 |
| Cycles in digraphs–a survey JC Bermond, C Thomassen Journal of Graph Theory 5 (1), 1-43, 1981 | 246 | 1981 |
| Strategies for interconnection networks: some methods from graph theory JC Bermond, C Delorme, JJ Quisquater Journal of Parallel and Distributed Computing 3 (4), 433-449, 1986 | 241 | 1986 |
| Graph problems arising from wavelength-routing in all-optical networks B Beauquier, JC Bermond, L Gargano, P Hell, S Pérennes, U Vaccaro INRIA, 1997 | 238 | 1997 |
| Decomposition into cycles: Hamilton decompositions BAJC Bermond, D Sotteau Cycles and rays, 9-18, 1990 | 211 | 1990 |
| Hamiltonian decomposition of Cayley graphs of degree 4 JC Bermond, O Favaron, M Maheo Journal of Combinatorial Theory, Series B 46 (2), 142-153, 1989 | 180 | 1989 |
| Graceful graphs, radio antennae and French windmills JC Bermond Proceedings One day Combinatorics Conference, Research Notes in Mathematics …, 1979 | 168 | 1979 |
| G-decomposition of Kn, where G has four vertices or less JC Bermond, J Schönheim Discrete Mathematics 19 (2), 113-120, 1977 | 168 | 1977 |
| Shortest coverings of graphs with cycles JC Bermond, B Jackson, F Jaeger Journal of Combinatorial Theory, Series B 35 (3), 297-308, 1983 | 156 | 1983 |
| Large fault-tolerant interconnection networks JC Bermond, N Homobono, C Peyrat Graphs and Combinatorics 5 (1), 107-123, 1989 | 150 | 1989 |
| Decomposition of complete graphs into isomorphic subgraphs with five vertices JC Bermond, C Huang, A Rosa, D Sotteau Ars combinatoria 10, 211-254, 1980 | 144 | 1980 |
| Graphs and interconnection networks: diameter and vulnerability JC Bermond, J Bond, M Paoli, C Peyrat Surveys in Combinatorics, London Math Society Lecture Notes Series 82, 1-30, 1983 | 141 | 1983 |
| Efficient collective communication in optical networks JC Bermond, L Gargano, S Perennes, AA Rescigno, U Vaccaro Automata, Languages and Programming: 23rd International Colloquium, ICALP'96 …, 1996 | 132 | 1996 |
| Graph decompositions and G-designs JC Bermond, D Sotteau 5th British Combinatorial Conference, 1975, Congressus Numerantium 15 …, 1976 | 131 | 1976 |
| Hamiltonian graphs JC Bermond Selected topics in graph theory, 127-167, 1979 | 129 | 1979 |
| On hamiltonian walks JC Bermond 5th British Combinatorial Conference, 1975, Congressus Numerantium 15 …, 1976 | 103 | 1976 |
| Hamiltonian decompositions of graphs, directed graphs and hypergraphs JC Bermond Annals of Discrete Mathematics 3, 21-28, 1978 | 102 | 1978 |
| Interconnection networks JC Bermond Elsevier, 2016 | 88 | 2016 |
| On linear k-arboricity JC Bermond, JL Fouquet, M Habib, B Peroche Discrete Mathematics 52 (2-3), 123-132, 1984 | 87 | 1984 |
