D. Amar

Covering of Vertices of A Simple Graph With Given Connectivity and stability Number

A. Germa, R. Häggkvist, D. Amar, 1984 .

Hamiltonian Cycles and Hamiltonian-biconnectedness

D. Amar, D. Brito, Ciclos Hamiltonianos, 2006 .

A degree condition implying that every matching is contained in a hamiltonian cycle

Denise Amar, Evelyne Flandrin, Grzegorz Gancarzewicz, 2009, Discret. Math..

Hamiltonian cycles and paths through matchings

Denise Amar, Evelyne Flandrin, Grzegorz Gancarzewicz, 2005, Electron. Notes Discret. Math..

A condition for a hamiltonian bipartite graph to be bipancyclic

Denise Amar, D. Amar, 1992, Discret. Math..

Covering the vertices of a digraph by cycles of prescribed length

André Raspaud, Denise Amar, A. Raspaud, 1991, Discret. Math..

All-to-all wavelength-routing in all-optical compound networks

Olivier Togni, André Raspaud, Denise Amar, 2001, Discret. Math..