Denise Amar

According to our database, Denise Amar authored at least 21 papers between 1983 and 2009.

Collaborative distances:

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

2009

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

Denise Amar, Evelyne Flandrin, Grzegorz Gancarzewicz

Discret. Math., 2009

2007

Bipartite graphs with every matching in a cycle.

Denise Amar, Evelyne Flandrin, Grzegorz Gancarzewicz, A. Pawel Wojda

Discret. Math., 2007

2005

Hamiltonian cycles and paths through matchings.

Denise Amar, Evelyne Flandrin, Grzegorz Gancarzewicz

Electron. Notes Discret. Math., 2005

2001

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

Denise Amar, André Raspaud, Olivier Togni

Discret. Math., 2001

Cyclability and pancyclability in bipartite graphs.

Mohamed El Kadi Abderrezzak, Evelyne Flandrin, Denise Amar

Discret. Math., 2001

1998

Irregularity strength of trees.

Denise Amar, Olivier Togni

Discret. Math., 1998

Neighborhood conditions for balanced independent sets in bipartite graphs.

Denise Amar, Stephan Brandt, Daniel Brito, Oscar Ordaz

Discret. Math., 1998

1996

Hamiltonian properties and the bipartite independence number.

Oscar Ordaz, Denise Amar, André Raspaud

Discret. Math., 1996

1995

Biclosure and bistability in a balanced bipartite graph.

Denise Amar, Odile Favaron, Pedro Mago, Oscar Ordaz

J. Graph Theory, 1995

1993

Irregularity strength of regular graphs of large degree.

Denise Amar

Discret. Math., 1993

Applying a condition for a hamiltonian bipartite graph to be bipancyclic.

Denise Amar

Discret. Math., 1993

1992

Hamiltonian paths and cycles, number of arcs and independence number in digraphs.

Yannis Manoussakis, Denise Amar

Discret. Math., 1992

A condition for a hamiltonian bipartite graph to be bipancyclic.

Denise Amar

Discret. Math., 1992

1991

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

Denise Amar, Irène Fournier, Anne Germa

Graphs Comb., 1991

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

Denise Amar, André Raspaud

Discret. Math., 1991

Pancyclism in hamiltonian graphs.

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

Discret. Math., 1991

1990

Cycles and paths of many lengths in bipartite digraphs.

Denise Amar, Yannis Manoussakis

J. Comb. Theory, Ser. B, 1990

1989

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

Denise Amar, Irène Fournier, Anne Germa

J. Graph Theory, 1989

1986

Partition of a bipartite hamiltonian graph into two cycles.

Denise Amar

Discret. Math., 1986

1983

On the Connectivity of Some Telecommunications Networks.

Denise Amar

IEEE Trans. Computers, 1983

Hamiltonian pancyclic graphs.

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

Discret. Math., 1983