Jean-François Saclé

Discret. Math. Algorithms Appl., 2012

2005

A note on maximal common subgraphs of the Dirac's family of graphs.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2005

2001

On the packing of three graphs.

[BibT_eX]

[DOI]

Discret. Math., 2001

2000

Packing two copies of a tree into its fourth power.

[BibT_eX]

[DOI]

Hamamache Kheddouci

Discret. Math., 2000

1997

The Erdös-Sós Conjecture for Graphs without<i>C</i><sub>4</sub>.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. B, 1997

On graphs which contain each tree of given size.

[BibT_eX]

[DOI]

Discret. Math., 1997

A note on packing of three forests.

[BibT_eX]

[DOI]

Discret. Math., 1997

1996

Edge-disjoint Placement of Three Trees.

[BibT_eX]

[DOI]

Eur. J. Comb., 1996

Lower bounds for the size in four families of minimum broadcast graphs.

[BibT_eX]

[DOI]

Discret. Math., 1996

1994

Note on the problem of gossiping in multidimensional grids.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1994

Some minimum broadcast graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1994

1993

Some eigenvalue properties in graphs (conjectures of Graffiti - II).

[BibT_eX]

[DOI]

Odile Favaron

Discret. Math., 1993

1991

On the residue of a graph.

[BibT_eX]

[DOI]

Odile Favaron