Denise Amar

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

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2009
A degree condition implying that every matching is contained in a hamiltonian cycle.
Discret. Math., 2009

2007
Bipartite graphs with every matching in a cycle.
Discret. Math., 2007

2005
Hamiltonian cycles and paths through matchings.
Electron. Notes Discret. Math., 2005

2001
All-to-all wavelength-routing in all-optical compound networks.
Discret. Math., 2001

Cyclability and pancyclability in bipartite graphs.
Discret. Math., 2001

1998
Irregularity strength of trees.
Discret. Math., 1998

Neighborhood conditions for balanced independent sets in bipartite graphs.
Discret. Math., 1998

1996
Hamiltonian properties and the bipartite independence number.
Discret. Math., 1996

1995
Biclosure and bistability in a balanced bipartite graph.
J. Graph Theory, 1995

1993
Irregularity strength of regular graphs of large degree.
Discret. Math., 1993

Applying a condition for a hamiltonian bipartite graph to be bipancyclic.
Discret. Math., 1993

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

A condition for a hamiltonian bipartite graph to be bipancyclic.
Discret. Math., 1992

1991
Pancyclism in Chvátal-Erdös's graphs.
Graphs Comb., 1991

Covering the vertices of a digraph by cycles of prescribed length.
Discret. Math., 1991

Pancyclism in hamiltonian graphs.
Discret. Math., 1991

1990
Cycles and paths of many lengths in bipartite digraphs.
J. Comb. Theory B, 1990

1989
Covering the vertices of a graph by cycles of prescribed length.
J. Graph Theory, 1989

1986
Partition of a bipartite hamiltonian graph into two cycles.
Discret. Math., 1986

1983
On the Connectivity of Some Telecommunications Networks.
IEEE Trans. Computers, 1983

Hamiltonian pancyclic graphs.
Discret. Math., 1983


  Loading...