The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Denise Amar: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  16. A degree condition implying that every matching is contained in a hamiltonian cycle. [Citation Graph (, )][DBLP]


Search in 0.014secs, Finished in 0.016secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002