Ahmed Ainouche

Publication Activity (10 Years)

Years Active: 1981-2012
Publications (10 Years): 0

Top Topics

Pattern Recognition

Transitive Closure

Subgraph Isomorphism

Graph Databases

Top Venues

Publications

Ahmed Ainouche
alpha-degree closures for graphs. Discret. Math. 312 (2) (2012)
Ahmed Ainouche
beta-degree closures for graphs. Discret. Math. 309 (10) (2009)
Ahmed Ainouche
Dirac's Type Sufficient Conditions for Hamiltonicity and Pancyclicity. Graphs Comb. 25 (2) (2009)
Ahmed Ainouche
beta-neighborhood closures for graphs. Discret. Math. 309 (10) (2009)
Ahmed Ainouche, Serge Lapiquonne
Variations on a sufficient condition for Hamiltonian graphs. Discuss. Math. Graph Theory 27 (2) (2007)
Ahmed Ainouche
Extensions of Bondys Theorem on Cycles in 2-Connected Graphs. Ars Comb. 85 (2007)
Ahmed Ainouche
Relaxations of Ore's Condition on Cycles. Electron. J. Comb. 13 (1) (2006)
Ahmed Ainouche
Extension of several sufficient conditions for Hamiltonian graphs. Discuss. Math. Graph Theory 26 (1) (2006)
Ahmed Ainouche, Serge Lapiquonne
Hamilton connectedness and the partially square graphs. Discret. Math. 306 (12) (2006)
Ahmed Ainouche, Ingo Schiermeyer
0-Dual Closures for Several Classes of Graphs. Graphs Comb. 19 (3) (2003)
Ahmed Ainouche, Mekkia Kouider
Cycles in Partially Square Graphs. Graphs Comb. 17 (1) (2001)
Ahmed Ainouche, Mekkia Kouider
Hamiltonism and Partially Square Graphs. Graphs Comb. 15 (3) (1999)
Ahmed Ainouche
Quasi-claw-free graphs. Discret. Math. 179 (1-3) (1998)
Ahmed Ainouche, Odile Favaron, Hao Li
Global insertion and hamiltonicity in DCT-graphs. Discret. Math. 184 (1-3) (1998)
Ahmed Ainouche
A short proof of a theorem on Hamiltonian graphs. J. Graph Theory 22 (1) (1996)
Ahmed Ainouche
A common generalization of Chvátal-Erdös' and Fraisse's sufficient conditions for hamiltonian graphs. Discret. Math. 142 (1-3) (1995)
Ahmed Ainouche, Ingo Schiermeyer
Insertible vertices, neighborhood intersections, and hamiltonicity. J. Graph Theory 20 (2) (1995)
Ahmed Ainouche
An improvement of fraisse's sufficient condition for hamiltonian graphs. J. Graph Theory 16 (6) (1992)
Ahmed Ainouche
Four sufficient conditions for hamiltonian graphs. Discret. Math. 89 (2) (1991)
Ahmed Ainouche, Nicos Christofides
Semi-independence number of a graph and the existence of Hamiltonian circuits. Discret. Appl. Math. 17 (3) (1987)
Ahmed Ainouche, Nicos Christofides
Strong sufficient conditions for the existence of Hamiltonian circuits in undirected graphs. J. Comb. Theory, Ser. B 31 (3) (1981)