Joël Puech

13 papers Journal 13
YearRankTypeTitle / Venue / Authors
2003 J jnl
Irredundance and domination in kings graphs.
Discret. Math.
Odile Favaron, Gerd Fricke, Dan Pritikin, Joël Puech
2002 J jnl
Decomposable trees: a polynomial algorithm fortripodes.
Discret. Appl. Math.
Dominique Barth, Olivier Baudon, Joël Puech
2001 J jnl
Generalised Ramsey Numbers with respect to Classes of Graphs.
Ars Comb.
Ernest J. Cockayne, Odile Favaron, Paul J. P. Grobler, Christina M. Mynhardt, Joël Puech
2001 J jnl
On domination and annihilation in graphs with claw-free blocks.
Discret. Math.
Odile Favaron, Michael A. Henning, Joël Puech, Dieter Rautenbach
2001 J jnl
Ramsey properties of generalised irredundant sets in graphs.
Discret. Math.
Ernest J. Cockayne, Odile Favaron, Paul J. P. Grobler, Christina M. Mynhardt, Joël Puech
2000 J jnl
A characterization of (γ,
J. Graph Theory
Ernest J. Cockayne, Odile Favaron, Christina M. Mynhardt, Joël Puech
2000 J jnl
Total domination in graphs with minimum degree three.
J. Graph Theory
Odile Favaron, Michael A. Henning, Christina M. Mynhardt, Joël Puech
1999 J jnl
Irredundant and perfect neighborhood sets in graphs and claw-free graphs.
Discret. Math.
Odile Favaron, Joël Puech
1999 J jnl
Stability, domination, and irredundance in WAR graphs.
Ars Comb.
Joël Puech
1998 J jnl
An inequality chain of domination parameters for trees.
Discuss. Math. Graph Theory
Ernest J. Cockayne, Odile Favaron, Christina M. Mynhardt, Joël Puech
1998 J jnl
Irredundance in grids.
Discret. Math.
Odile Favaron, Joël Puech
1998 J jnl
Irredundance perfect and
J. Graph Theory
Joël Puech
1998 J jnl
Packing, perfect neighbourhood, irredundant and R-annihilated sets in graphs.
Australas. J Comb.
Ernest J. Cockayne, Odile Favaron, Joël Puech, Christina M. Mynhardt