Graphs & Applications
Publications of Denise AMAR

(bibtex format)
[publications of the team]

Copyrights for some of the papers below have been transfered, or will be transfered to various publishers of journals, conferences proceedings, etc. For such papers I am required to post the following notice: This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. Publisher's copyright policy are available at © SIAM, © ACM, © IEEE, © Springer, © Elsevier, © Ideal, © King's College.


[ 2005 | 2001 | 1999 | 1998 | 1996 | 1995 | 1993 | 1992]


2005

  1. D. Amar, E. Flandrin, G. Gancarzewicz, and A.P. Wojda. Bipartite graphs with every matching in a cycle. Discrete Math., 2005. To appear.

  2. D. Amar, E. Flandrin, and G. Gancarzewicz. Cyclability in bipartite graphs, 2005. Submitted.

  3. D. Amar, D. Brito, and O. Ordaz. Hamiltonian cycles and hamiltonian biconnectedness in bipartite digraph. Divulgacines Matematicas, 2005. To appear.



2001

  1. D. Amar, M. El Kadi Abderrezzak, and E. Flandrin. Cyclability and pancyclability in bipartite graphs. Discrete Math., 236:3-11, 2001.



1999

  1. D. Amar, A. Raspaud, and O. Togni. All-to-all wavelength-routing in all-optical compound networks. In Proceedings of the 5-Czech-Slovak International Symposium on Combinatorics, Graph Theory, Algorithms and Applications, Prague July 6-11, 1998. Elsevier, 1999. To appear in Discrete Math.



1998

  1. D. Amar, S. Brandt, D. Brito, and O. Ordaz. Neighborhood conditions for independent sets in bipartite graphs. Discrete Math., 181:31-36, 1998.

  2. D. Amar and O. Togni. Irregularity strengh of trees. Discrete Math., 190:15-38, 1998.



1996

  1. D. Amar, O. Ordaz, and A. Raspaud. Hamiltonian properties and the bipartite independence number. Discrete Math., 161:207-215, 1996.



1995

  1. D. Amar, S. Brandt, D. Brito, and O. Ordaz. Neighborhood conditions for balanced independent sets in bipartite graphs. Rapport interne, Freie Universität Berlin, 1995.

  2. D. Amar, O. Favaron, P. Mago, and O. Ordaz. Biclosure and bistability in a balanced bipartite graph. Journal of Graph Theory, 20:513-529, 1995.



1993

  1. D. Amar, D. Brito, and O. Ordaz. Hamiltonian cycles and hamiltonian-biconnectedness in bipartite digraphs. Rapport interne, LaBRI, Université Bordeaux I, 1993. Soumis pour publication.

  2. D. Amar, D. Brito, and O. Ordaz. Balanced bipartite sets and cycles in bipartite graphs. Rapport interne, LaBRI, Université Bordeaux I, 1993. Soumis pour publication.

  3. D. Amar. Irregularity strength of regular graphs of large degree. Discrete Math., 114:9-17, 1993.

  4. D. Amar. Applying a condition for a hamiltonian bipartite graph to be bipancyclic. Discrete Math., 111:19-25, 1993.

  5. D. Amar, D. Brito, and O. Ordaz. Hamiltonism and neighborhood of balanced bipartite sets in bipartite graphs. Rapport interne, LaBRI, Université Bordeaux I, 1993. Soumis pour publication.



1992

  1. D. Amar. Paths and cycles in bipartite graphs. In VI Jordanas en teoria de grafos y sus aplicaciones. Cumaná (Venezuela), 1992.

  2. D. Amar and Y. Manoussakis. Hamiltonian paths and cycles, number of arcs and independance number in digraphs. Discrete Math., 105:1-16, 1992.

  3. D. Amar. Hamiltonism in bipartite digraphs. In VI Jordanas en teoria de grafos y sus aplicaciones. Cumaná (Venezuela), 1992.

  4. D. Amar. A condition for a hamiltonian bipartite graph to be bipancyclic. Discrete Math., 102:221-227, 1992.



10 janvier 2008 (19)
[home page of the team]