Search the dblp DataBase

Publications of Author

1. Ahmed Ainouche, Serge Lapiquonne
   Hamilton connectedness and the partially square graphs. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 2006, v:306, n:12, pp:1097-1104 [Journal]
   
2. Ahmed Ainouche, Mekkia Kouider
   Cycles in Partially Square Graphs. [Citation Graph (0, 0)][DBLP]
   Graphs and Combinatorics, 2001, v:17, n:1, pp:1-9 [Journal]
   
3. Ahmed Ainouche, Ingo Schiermeyer
   0-Dual Closures for Several Classes of Graphs. [Citation Graph (0, 0)][DBLP]
   Graphs and Combinatorics, 2003, v:19, n:3, pp:297-307 [Journal]
   
4. Ahmed Ainouche, Nicos Christofides
   Strong sufficient conditions for the existence of Hamiltonian circuits in undirected graphs. [Citation Graph (0, 0)][DBLP]
   J. Comb. Theory, Ser. B, 1981, v:31, n:3, pp:339-343 [Journal]
   
5. Ahmed Ainouche, Odile Favaron, Hao Li
   Global insertion and hamiltonicity in DCT-graphs. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 1998, v:184, n:1-3, pp:1-13 [Journal]
   
6. Ahmed Ainouche
   Quasi-claw-free graphs. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 1998, v:179, n:1-3, pp:13-26 [Journal]
   
7. Ahmed Ainouche
   Four sufficient conditions for hamiltonian graphs. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 1991, v:89, n:2, pp:195-200 [Journal]
   
8. Ahmed Ainouche
   A common generalization of Chvátal-Erdös' and Fraisse's sufficient conditions for hamiltonian graphs. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 1995, v:142, n:1-3, pp:1-19 [Journal]
   
9. 
   Extensions of Bondys Theorem on Cycles in 2-Connected Graphs. [Citation Graph (, )][DBLP]
   
   
10. 
    Relaxations of Ore's Condition on Cycles. [Citation Graph (, )][DBLP]
    
    
11. 
    beta-neighborhood closures for graphs. [Citation Graph (, )][DBLP]
    
    
12. 
    beta-degree closures for graphs. [Citation Graph (, )][DBLP]