| | |
- CSB - MetaPress - Google - Bing - Yahoo
 | 2012 | |
|---|---|---|
| 17 |      | Ahmed Ainouche: alpha-degree closures for graphs. Discrete Mathematics 312(2): 390-396 (2012) |
| 2009 | ||
| 16 | | Ahmed Ainouche: beta-neighborhood closures for graphs. Discrete Mathematics 309(10): 2961-2967 (2009) |
| 15 | | Ahmed Ainouche: beta-degree closures for graphs. Discrete Mathematics 309(10): 2968-2973 (2009) |
| 14 | | Ahmed Ainouche: Dirac's Type Sufficient Conditions for Hamiltonicity and Pancyclicity. Graphs and Combinatorics 25(2): 129-137 (2009) |
| 2007 | ||
| 13 |  | Ahmed Ainouche: Extensions of Bondys Theorem on Cycles in 2-Connected Graphs. Ars Comb. 85: (2007) |
| 12 | | Ahmed Ainouche, Serge Lapiquonne: Variations on a sufficient condition for Hamiltonian graphs. Discussiones Mathematicae Graph Theory 27(2): 229-240 (2007) |
| 2006 | ||
| 11 | | Ahmed Ainouche, Serge Lapiquonne: Hamilton connectedness and the partially square graphs. Discrete Mathematics 306(12): 1097-1104 (2006) |
| 10 | | Ahmed Ainouche: Extension of several sufficient conditions for Hamiltonian graphs. Discussiones Mathematicae Graph Theory 26(1): 23-39 (2006) |
| 9 | | Ahmed Ainouche: Relaxations of Ore's Condition on Cycles. Electr. J. Comb. 13(1): (2006) |
| 2003 | ||
| 8 | | Ahmed Ainouche, Ingo Schiermeyer: 0-Dual Closures for Several Classes of Graphs. Graphs and Combinatorics 19(3): 297-307 (2003) |
| 2001 | ||
| 7 | | Ahmed Ainouche, Mekkia Kouider: Cycles in Partially Square Graphs. Graphs and Combinatorics 17(1): 1-9 (2001) |
| 1999 | ||
| 6 | | Ahmed Ainouche, Mekkia Kouider: Hamiltonism and Partially Square Graphs. Graphs and Combinatorics 15(3): 257-265 (1999) |
| 1998 | ||
| 5 | | Ahmed Ainouche: Quasi-claw-free graphs. Discrete Mathematics 179(1-3): 13-26 (1998) |
| 4 | | Ahmed Ainouche, Odile Favaron, Hao Li: Global insertion and hamiltonicity in DCT-graphs. Discrete Mathematics 184(1-3): 1-13 (1998) |
| 1995 | ||
| 3 | | Ahmed 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 | ||
| 2 | | Ahmed Ainouche: Four sufficient conditions for hamiltonian graphs. Discrete Mathematics 89(2): 195-200 (1991) |
| 1981 | ||
| 1 | | Ahmed 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) |
| 1 | Nicos Christofides | [1] |
| 2 | Odile Favaron | [4] |
| 3 | Mekkia Kouider | [6] [7] |
| 4 | Serge Lapiquonne | [11] [12] |
| 5 | Hao Li | [4] |
| 6 | Ingo Schiermeyer | [8] |
Colors in the list of coauthors
Last update Sat May 26 04:23:17 2012 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page