Anne Germa

According to our database, Anne Germa authored at least 9 papers between 1979 and 1998.

Collaborative distances:

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

1998

Cycles in the cube-connected cycles graph.

Anne Germa, Marie-Claude Heydemann, Dominique Sotteau

Discret. Appl. Math., 1998

1996

Emulating Networks by Bus Networks: Application to Trees and Hypermeshes.

Dominique Barth, Anne Germa, Marie-Claude Heydemann, Dominique Sotteau

Proceedings of the SIROCCO'96, 1996

1991

Pancyclism in Chvátal-Erdös's graphs.

Denise Amar, Irène Fournier, Anne Germa

Graphs Comb., 1991

Pancyclism in hamiltonian graphs.

Denise Amar, Evelyne Flandrin, Irène Fournier, Anne Germa

Discret. Math., 1991

1989

Covering the vertices of a graph by cycles of prescribed length.

Denise Amar, Irène Fournier, Anne Germa

J. Graph Theory, 1989

1983

Hamiltonian pancyclic graphs.

Denise Amar, Evelyne Flandrin, Irène Fournier, Anne Germa

Discret. Math., 1983

1981

Longest paths in digraphs.

Jean-Claude Bermond, Anne Germa, Marie-Claude Heydemann, Dominique Sotteau

Comb., 1981

1980

Girth in digraphs.

Jean-Claude Bermond, Anne Germa, Marie-Claude Heydemann, Dominique Sotteau

J. Graph Theory, 1980

1979

Resolvable Decomposition of K_n.

Jean-Claude Bermond, Anne Germa, Dominique Sotteau

J. Comb. Theory A, 1979