 | 2003 |
|---|
| 9 |       | Odile Favaron,
Gerd Fricke,
Dan Pritikin,
Joël Puech:
Irredundance and domination in kings graphs.
Discrete Mathematics 262(1-3): 131-147 (2003) |
| 2002 |
|---|
| 8 |  | Dominique Barth,
Olivier Baudon,
Joël Puech:
Decomposable trees: a polynomial algorithm fortripodes.
Discrete Applied Mathematics 119(3): 205-216 (2002) |
| 2001 |
|---|
| 7 | | Ernest J. Cockayne,
Odile Favaron,
Paul J. P. Grobler,
Christina M. Mynhardt,
Joël Puech:
Generalised Ramsey Numbers with respect to Classes of Graphs.
Ars Comb. 59: (2001) |
| 6 | | Ernest J. Cockayne,
Odile Favaron,
Paul J. P. Grobler,
Christina M. Mynhardt,
Joël Puech:
Ramsey properties of generalised irredundant sets in graphs.
Discrete Mathematics 231(1-3): 123-134 (2001) |
| 5 | | Odile Favaron,
Michael A. Henning,
Joël Puech,
Dieter Rautenbach:
On domination and annihilation in graphs with claw-free blocks.
Discrete Mathematics 231(1-3): 143-151 (2001) |
| 2000 |
|---|
| 4 | | Joël Puech:
R-annihilated and independent perfect neighborhood sets in chordal graphs.
Discrete Mathematics 215: 181-199 (2000) |
| 1999 |
|---|
| 3 | | Joël Puech:
Stability, domination, and irredundance in WAR graphs.
Ars Comb. 52: (1999) |
| 2 | | Odile Favaron,
Joël Puech:
Irredundant and perfect neighborhood sets in graphs and claw-free graphs.
Discrete Mathematics 197-198: 269-284 (1999) |
| 1998 |
|---|
| 1 | | Odile Favaron,
Joël Puech:
Irredundance in grids.
Discrete Mathematics 179(1-3): 257-265 (1998) |
