Denise Amar - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 20 from 20

2009

A degree condition implying that every matching is contained in a hamiltonian cycleDenise Amar, Evelyne Flandrin, Grzegorz Gancarzewicz. DM, 309(11):3703-3713, 2009. [doi]

2007

Bipartite graphs with every matching in a cycleDenise Amar, Evelyne Flandrin, Grzegorz Gancarzewicz, A. Pawel Wojda. DM, 307(11-12):1525-1537, 2007. [doi]

2005

Hamiltonian cycles and paths through matchingsDenise Amar, Evelyne Flandrin, Grzegorz Gancarzewicz. endm, 22:543-547, 2005. [doi]

2001

Cyclability and pancyclability in bipartite graphsMohamed El Kadi Abderrezzak, Evelyne Flandrin, Denise Amar. DM, 236(1-3):3-11, 2001. [doi]

All-to-all wavelength-routing in all-optical compound networksDenise Amar, André Raspaud, Olivier Togni. DM, 235(1-3):353-363, 2001. [doi]

1998

Neighborhood conditions for balanced independent sets in bipartite graphsDenise Amar, Stephan Brandt, Daniel Brito, Oscar Ordaz. DM, 181(1-3):31-36, 1998. [doi]

Irregularity strength of treesDenise Amar, Olivier Togni. DM, 190(1-3):15-38, 1998. [doi]

1996

Hamiltonian properties and the bipartite independence numberOscar Ordaz, Denise Amar, André Raspaud. DM, 161(1-3):207-215, 1996. [doi]

1995

Biclosure and bistability in a balanced bipartite graphDenise Amar, Odile Favaron, Pedro Mago, Oscar Ordaz. jgt, 20(4):513-529, 1995. [doi]

1993

Applying a condition for a hamiltonian bipartite graph to be bipancyclicDenise Amar. DM, 111(1-3):19-25, 1993. [doi]

1992

A condition for a hamiltonian bipartite graph to be bipancyclicDenise Amar. DM, 102(3):221-227, 1992. [doi]

Hamiltonian paths and cycles, number of arcs and independence number in digraphsYannis Manoussakis, Denise Amar. DM, 105(1-3):157-172, 1992. [doi]

1991

Covering the vertices of a digraph by cycles of prescribed lengthDenise Amar, André Raspaud. DM, 87(2):111-118, 1991. [doi]

Pancyclism in hamiltonian graphsDenise Amar, Evelyne Flandrin, Irène Fournier, Anne Germa. DM, 89(2):111-131, 1991. [doi]

Pancyclism in Chvátal-Erdös's graphsDenise Amar, Irène Fournier, Anne Germa. gc, 7(2):101-112, 1991. [doi]

1990

Cycles and paths of many lengths in bipartite digraphsDenise Amar, Yannis Manoussakis. JCT, 50(2):254-264, 1990. [doi]

1989

Covering the vertices of a graph by cycles of prescribed lengthDenise Amar, Irène Fournier, Anne Germa. jgt, 13(3):323-330, 1989. [doi]

1986

Partition of a bipartite hamiltonian graph into two cyclesDenise Amar. DM, 58(1):1-10, 1986. [doi]

1983

On the Connectivity of Some Telecommunications NetworksDenise Amar. TC, 32(5):512-519, 1983.

Hamiltonian pancyclic graphsDenise Amar, Evelyne Flandrin, Irène Fournier, Anne Germa. DM, 46(3):327, 1983. [doi]

Sign in or sign up to see more results.

runs on WebDSL