| 2007 |
| 16 | EE | Denise Amar,
Evelyne Flandrin,
Grzegorz Gancarzewicz,
A. Pawel Wojda:
Bipartite graphs with every matching in a cycle.
Discrete Mathematics 307(11-12): 1525-1537 (2007) |
| 2005 |
| 15 | EE | Denise Amar,
Evelyne Flandrin,
Grzegorz Gancarzewicz:
Hamiltonian cycles and paths through matchings.
Electronic Notes in Discrete Mathematics 22: 543-547 (2005) |
| 2001 |
| 14 | EE | Denise Amar,
André Raspaud,
Olivier Togni:
All-to-all wavelength-routing in all-optical compound networks.
Discrete Mathematics 235(1-3): 353-363 (2001) |
| 13 | EE | Mohamed El Kadi Abderrezzak,
Evelyne Flandrin,
Denise Amar:
Cyclability and pancyclability in bipartite graphs.
Discrete Mathematics 236(1-3): 3-11 (2001) |
| 1998 |
| 12 | EE | Denise Amar,
Stephan Brandt,
Daniel Brito,
Oscar Ordaz:
Neighborhood conditions for balanced independent sets in bipartite graphs.
Discrete Mathematics 181(1-3): 31-36 (1998) |
| 11 | EE | Denise Amar,
Olivier Togni:
Irregularity strength of trees.
Discrete Mathematics 190(1-3): 15-38 (1998) |
| 1996 |
| 10 | EE | Oscar Ordaz,
Denise Amar,
André Raspaud:
Hamiltonian properties and the bipartite independence number.
Discrete Mathematics 161(1-3): 207-215 (1996) |
| 1993 |
| 9 | EE | Denise Amar:
Applying a condition for a hamiltonian bipartite graph to be bipancyclic.
Discrete Mathematics 111(1-3): 19-25 (1993) |
| 1992 |
| 8 | EE | Denise Amar:
A condition for a hamiltonian bipartite graph to be bipancyclic.
Discrete Mathematics 102(3): 221-227 (1992) |
| 7 | EE | Yannis Manoussakis,
Denise Amar:
Hamiltonian paths and cycles, number of arcs and independence number in digraphs.
Discrete Mathematics 105(1-3): 157-172 (1992) |
| 1991 |
| 6 | EE | Denise Amar,
André Raspaud:
Covering the vertices of a digraph by cycles of prescribed length.
Discrete Mathematics 87(2): 111-118 (1991) |
| 5 | EE | Denise Amar,
Evelyne Flandrin,
Irène Fournier,
Anne Germa:
Pancyclism in hamiltonian graphs.
Discrete Mathematics 89(2): 111-131 (1991) |
| 1990 |
| 4 | EE | Denise Amar,
Yannis Manoussakis:
Cycles and paths of many lengths in bipartite digraphs.
J. Comb. Theory, Ser. B 50(2): 254-264 (1990) |
| 1986 |
| 3 | EE | Denise Amar:
Partition of a bipartite hamiltonian graph into two cycles.
Discrete Mathematics 58(1): 1-10 (1986) |
| 1983 |
| 2 | EE | Denise Amar,
Evelyne Flandrin,
Irène Fournier,
Anne Germa:
Hamiltonian pancyclic graphs.
Discrete Mathematics 46(3): 327 (1983) |
| 1 | | Denise Amar:
On the Connectivity of Some Telecommunications Networks.
IEEE Trans. Computers 32(5): 512-519 (1983) |