Joël Puech

According to our database1, Joël Puech authored at least 14 papers between 1998 and 2003.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2003
Irredundance and domination in kings graphs.
Discret. Math., 2003

2002
Decomposable trees: a polynomial algorithm fortripodes.
Discret. Appl. Math., 2002

2001
On domination and annihilation in graphs with claw-free blocks.
Discret. Math., 2001

Ramsey properties of generalised irredundant sets in graphs.
Discret. Math., 2001

Generalised Ramsey Numbers with respect to Classes of Graphs.
Ars Comb., 2001

2000
Total domination in graphs with minimum degree three.
J. Graph Theory, 2000

A characterization of (γ, <i>i</i>)-trees.
J. Graph Theory, 2000

<i>R</i>-annihilated and independent perfect neighborhood sets in chordal graphs.
Discret. Math., 2000

1999
Irredundant and perfect neighborhood sets in graphs and claw-free graphs.
Discret. Math., 1999

Stability, domination, and irredundance in WAR graphs.
Ars Comb., 1999

1998
Irredundance perfect and <i>P</i><sub>6</sub>-free graphs.
J. Graph Theory, 1998

An inequality chain of domination parameters for trees.
Discuss. Math. Graph Theory, 1998

Irredundance in grids.
Discret. Math., 1998

Packing, perfect neighbourhood, irredundant and R-annihilated sets in graphs.
Australas. J Comb., 1998


  Loading...