Ahmed Ainouche Coauthor index DBLP Vis pubzone.org

List of publications from the DBLP Bibliography Server - FAQ
Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

DBLP keys2007
10no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAhmed Ainouche: Extensions of Bondys Theorem on Cycles in 2-Connected Graphs. Ars Comb. 85: (2007)
2006
9Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAhmed Ainouche, Serge Lapiquonne: Hamilton connectedness and the partially square graphs. Discrete Mathematics 306(12): 1097-1104 (2006)
8Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAhmed Ainouche: Relaxations of Ore's Condition on Cycles. Electr. J. Comb. 13(1): (2006)
2003
7Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAhmed Ainouche, Ingo Schiermeyer: 0-Dual Closures for Several Classes of Graphs. Graphs and Combinatorics 19(3): 297-307 (2003)
2001
6Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAhmed Ainouche, Mekkia Kouider: Cycles in Partially Square Graphs. Graphs and Combinatorics 17(1): 1-9 (2001)
1998
5Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAhmed Ainouche: Quasi-claw-free graphs. Discrete Mathematics 179(1-3): 13-26 (1998)
4Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAhmed Ainouche, Odile Favaron, Hao Li: Global insertion and hamiltonicity in DCT-graphs. Discrete Mathematics 184(1-3): 1-13 (1998)
1995
3Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAhmed Ainouche: A common generalization of Chvátal-Erdös' and Fraisse's sufficient conditions for hamiltonian graphs. Discrete Mathematics 142(1-3): 1-19 (1995)
1991
2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAhmed Ainouche: Four sufficient conditions for hamiltonian graphs. Discrete Mathematics 89(2): 195-200 (1991)
1981
1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAhmed Ainouche, Nicos Christofides: Strong sufficient conditions for the existence of Hamiltonian circuits in undirected graphs. J. Comb. Theory, Ser. B 31(3): 339-343 (1981)

Coauthor Index

1Nicos Christofides [1]
2Odile Favaron [4]
3Mekkia Kouider [6]
4Serge Lapiquonne [9]
5Hao Li [4]
6Ingo Schiermeyer [7]

Colors in the list of coauthors

Copyright © Fri Dec 4 16:04:45 2009 by Michael Ley (ley@uni-trier.de)