Maryvonne Mahéo

According to our database, Maryvonne Mahéo authored at least 15 papers between 1980 and 2012.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of two.

2012

SOME RESULTS ON (p, g, ∑)-VALUATION OF GRAPHS.

Maryvonne Mahéo, Jean-François Saclé

Discret. Math. Algorithms Appl., 2012

2002

Some bounds for the <i>b</i>-chromatic number of a grap.

Mekkia Kouider, Maryvonne Mahéo

Discret. Math., 2002

Connected [a, b]-factors in Graphs.

Mekkia Kouider, Maryvonne Mahéo

Comb., 2002

1998

Decomposition of multigraphs.

Krzysztof Brys, Mekkia Kouider, Zbigniew Lonc, Maryvonne Mahéo

Discuss. Math. Graph Theory, 1998

1997

Double total domination of graphs.

John Gimbel, Maryvonne Mahéo, Christine Virlouvet

Discret. Math., 1997

1996

Edge-disjoint Placement of Three Trees.

Maryvonne Mahéo, Jean-François Saclé, Mariusz Wozniak

Eur. J. Comb., 1996

1994

Note on the problem of gossiping in multidimensional grids.

Maryvonne Mahéo, Jean-François Saclé

Discret. Appl. Math., 1994

Some minimum broadcast graphs.

Maryvonne Mahéo, Jean-François Saclé

Discret. Appl. Math., 1994

1993

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

Odile Favaron, Maryvonne Mahéo, Jean-François Saclé

Discret. Math., 1993

1992

Isomorphisms of Cayley multigraphs of degree 4 on finite abelian groups.

Charles Delorme, Odile Favaron, Maryvonne Mahéo

Eur. J. Comb., 1992

1991

On the residue of a graph.

Odile Favaron, Maryvonne Mahéo, Jean-François Saclé

J. Graph Theory, 1991

1989

Edge-vulnerability and mean distance.

Odile Favaron, Mekkia Kouider, Maryvonne Mahéo

Networks, 1989

Hamiltonian decomposition of Cayley graphs of degree 4.

Jean-Claude Bermond, Odile Favaron, Maryvonne Mahéo

J. Comb. Theory, Ser. B, 1989

1980

Cycles with a chord are graceful.

Charles Delorme, Maryvonne Mahéo, Henri Thuillier, Khee Meng Koh, H. K. Teo

J. Graph Theory, 1980

Strongly graceful graphs.

Maryvonne Mahéo

Discret. Math., 1980