 | 2008 |
|---|
| 31 |       | Domingos Moreira Cardoso,
J. Orestes Cerdeira,
Charles Delorme,
Pedro C. Silva:
Efficient edge domination in regular graphs.
Discrete Applied Mathematics 156(15): 3060-3065 (2008) |
| 2007 |
|---|
| 30 | | Domingos Moreira Cardoso,
Charles Delorme,
Paula Rama:
Laplacian eigenvectors and eigenvalues and almost equitable partitions.
Eur. J. Comb. 28(3): 665-673 (2007) |
| 2004 |
|---|
| 29 | | Charles Delorme:
Laplacian eigenvalues and fixed size multisection.
Discrete Mathematics 276(1-3): 149-159 (2004) |
| 28 | | Charles Delorme,
Samuel Gonzalez,
Oscar Ordaz,
María Teresa Varela:
Barycentric sequences and barycentric Ramsey numbers stars.
Discrete Mathematics 277(1-3): 45-56 (2004) |
| 27 | | Charles Delorme,
Isabel Marquez,
Oscar Ordaz,
Asdrubal Ortuño:
Existence conditions for barycentric sequences.
Discrete Mathematics 281(1-3): 163-172 (2004) |
| 2003 |
|---|
| 26 | | Charles Delorme,
Odile Favaron,
Dieter Rautenbach:
Closed formulas for the numbers of small independent sets and matchings and an extremal problem for trees.
Discrete Applied Mathematics 130(3): 503-512 (2003) |
| 2002 |
|---|
| 25 | | Charles Delorme,
Odile Favaron,
Dieter Rautenbach:
On the Randic Image index.
Discrete Mathematics 257(1): 29-38 (2002) |
| 24 | | Charles Delorme,
Odile Favaron,
Dieter Rautenbach:
On the reconstruction of the degree sequence.
Discrete Mathematics 259(1-3): 293-300 (2002) |
| 23 | | Charles Delorme,
J. Gómez:
Some New Large Compound Graphs.
Eur. J. Comb. 23(5): 539-547 (2002) |
| 2001 |
|---|
| 22 | | Charles Delorme:
Presentations of groups generated by transpositions.
Discrete Mathematics 236(1-3): 59-64 (2001) |
| 21 | | Charles Delorme,
Oscar Ordaz,
Domingo Quiroz:
Some remarks on Davenport constant.
Discrete Mathematics 237(1-3): 119-128 (2001) |
| 2000 |
|---|
| 20 | | Charles Delorme:
Laplacian Eigenvalues and multisections.
Electronic Notes in Discrete Mathematics 5: 93-96 (2000) |
| 1999 |
|---|
| 19 | | Fan R. K. Chung,
Charles Delorme,
Patrick Solé:
Multidiameters and Multiplicities.
Eur. J. Comb. 20(7): 629-640 (1999) |
| 1998 |
|---|
| 18 | | Charles Delorme,
Jean-Pierre Tillich:
The Spectrum of de Bruijn and Kautz Graphs.
Eur. J. Comb. 19(3): 307-319 (1998) |
| 17 | | Charles Delorme,
Oscar Ordaz,
Domingo Quiroz:
Tools for studying paths and cycles in digraphs.
Networks 31(2): 125-148 (1998) |
| 16 |  | Evripidis Bampis,
Charles Delorme,
Jean-Claude König:
Optimal Schedules for d-D Grid Graphs with Communication Delays.
Parallel Computing 24(11): 1653-1664 (1998) |
| 1997 |
|---|
| 15 | | Charles Delorme,
Jean-Pierre Tillich:
Eigenvalues, eigenspaces and distances to subsets.
Discrete Mathematics 165-166: 171-194 (1997) |
| 1996 |
|---|
| 14 | | Charles Delorme,
Petrisor Panaite:
Rubik Routing Permutations on Graphs.
Euro-Par, Vol. I 1996: 283-286 |
| 13 | | Evripidis Bampis,
Charles Delorme,
Jean-Claude König:
Optimal Schedules for d-D Grid Graphs with Communication Delays (Extended Abstract).
STACS 1996: 655-666 |
| 1995 |
|---|
| 12 | | Abdelmadjid Bouabdallah,
Charles Delorme,
Selma Djelloul:
Edge Deletion Preserving the Diameter of the Hypercube.
Discrete Applied Mathematics 63(1): 91-95 (1995) |
| 1994 |
|---|
| 11 | | Charles Delorme:
Distance Biregular Bipartite Graphs.
Eur. J. Comb. 15(3): 223-238 (1994) |
| 1993 |
|---|
| 10 | | Charles Delorme,
Svatopluk Poljak:
The performance of an eigenvalue bound on the max-cut problem in some classes of graphs.
Discrete Mathematics 111(1-3): 145-156 (1993) |
| 9 | | Charles Delorme,
Svatopluk Poljak:
Combinatorial Properties and the Complexity of a Max-cut Approximation .
Eur. J. Comb. 14(4): 313-333 (1993) |
| 8 | | Charles Delorme,
Svatopluk Poljak:
Laplacian eigenvalues and the maximum cut problem.
Math. Program. 62: 557-574 (1993) |
| 1992 |
|---|
| 7 | | Charles Delorme:
Examples of Products Giving Large Graphs with Given Degree and Diameter.
Discrete Applied Mathematics 37/38: 157-167 (1992) |
| 6 | | Jean-Claude Bermond,
Charles Delorme,
Jean-Jacques Quisquater:
Table of Large (Delta, D)-Graphs.
Discrete Applied Mathematics 37/38: 575-577 (1992) |
| 1986 |
|---|
| 5 | | Jean-Claude Bermond,
Charles Delorme,
Jean-Jacques Quisquater:
Strategies for Interconnection Networks: Some Methods from Graph Theory.
J. Parallel Distrib. Comput. 3(4): 433-449 (1986) |
| 1984 |
|---|
| 4 | | Charles Delorme,
Gena Hahn:
Infinite generalized friendship graphs.
Discrete Mathematics 49(3): 261-266 (1984) |
| 3 | | Charles Delorme,
G. Farhi:
Large Graphs with Given Degree and Diameter - Part I.
IEEE Trans. Computers 33(9): 857-860 (1984) |
| 2 | | Jean-Claude Bermond,
Charles Delorme,
G. Farhi:
Large graphs with given degree and diameter. II.
J. Comb. Theory, Ser. B 36(1): 32-48 (1984) |
| 1982 |
|---|
| 1 | | Jean-Claude Bermond,
Charles Delorme,
Jean-Jacques Quisquater:
Tables of Large Graphs with Given Degree and Diameter.
Inf. Process. Lett. 15(1): 10-13 (1982) |
