Ahmed Ainouche

21 papers Journal 21
YearRankTypeTitle / Venue / Authors
2012 J jnl
alpha-degree closures for graphs.
Discret. Math.
Ahmed Ainouche
2009 J jnl
Dirac's Type Sufficient Conditions for Hamiltonicity and Pancyclicity.
Graphs Comb.
Ahmed Ainouche
2009 J jnl
beta-degree closures for graphs.
Discret. Math.
Ahmed Ainouche
2009 J jnl
beta-neighborhood closures for graphs.
Discret. Math.
Ahmed Ainouche
2007 J jnl
Extensions of Bondys Theorem on Cycles in 2-Connected Graphs.
Ars Comb.
Ahmed Ainouche
2007 J jnl
Variations on a sufficient condition for Hamiltonian graphs.
Discuss. Math. Graph Theory
Ahmed Ainouche, Serge Lapiquonne
2006 J jnl
Extension of several sufficient conditions for Hamiltonian graphs.
Discuss. Math. Graph Theory
Ahmed Ainouche
2006 J jnl
Hamilton connectedness and the partially square graphs.
Discret. Math.
Ahmed Ainouche, Serge Lapiquonne
2006 J jnl
Relaxations of Ore's Condition on Cycles.
Electron. J. Comb.
Ahmed Ainouche
2003 J jnl
0-Dual Closures for Several Classes of Graphs.
Graphs Comb.
Ahmed Ainouche, Ingo Schiermeyer
2001 J jnl
Cycles in Partially Square Graphs.
Graphs Comb.
Ahmed Ainouche, Mekkia Kouider
1999 J jnl
Hamiltonism and Partially Square Graphs.
Graphs Comb.
Ahmed Ainouche, Mekkia Kouider
1998 J jnl
Global insertion and hamiltonicity in DCT-graphs.
Discret. Math.
Ahmed Ainouche, Odile Favaron, Hao Li
1998 J jnl
Quasi-claw-free graphs.
Discret. Math.
Ahmed Ainouche
1996 J jnl
A short proof of a theorem on Hamiltonian graphs.
J. Graph Theory
Ahmed Ainouche
1995 J jnl
A common generalization of Chvátal-Erdös' and Fraisse's sufficient conditions for hamiltonian graphs.
Discret. Math.
Ahmed Ainouche
1995 J jnl
Insertible vertices, neighborhood intersections, and hamiltonicity.
J. Graph Theory
Ahmed Ainouche, Ingo Schiermeyer
1992 J jnl
An improvement of fraisse's sufficient condition for hamiltonian graphs.
J. Graph Theory
Ahmed Ainouche
1991 J jnl
Four sufficient conditions for hamiltonian graphs.
Discret. Math.
Ahmed Ainouche
1987 J jnl
Semi-independence number of a graph and the existence of Hamiltonian circuits.
Discret. Appl. Math.
Ahmed Ainouche, Nicos Christofides
1981 J jnl
Strong sufficient conditions for the existence of Hamiltonian circuits in undirected graphs.
J. Comb. Theory B
Ahmed Ainouche, Nicos Christofides