Ahmed Ainouche

According to our database, Ahmed Ainouche authored at least 21 papers between 1981 and 2012.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2012

alpha-degree closures for graphs.

Ahmed Ainouche

Discret. Math., 2012

2009

Dirac's Type Sufficient Conditions for Hamiltonicity and Pancyclicity.

Ahmed Ainouche

Graphs Comb., 2009

beta-degree closures for graphs.

Ahmed Ainouche

Discret. Math., 2009

beta-neighborhood closures for graphs.

Ahmed Ainouche

Discret. Math., 2009

2007

Variations on a sufficient condition for Hamiltonian graphs.

Ahmed Ainouche, Serge Lapiquonne

Discuss. Math. Graph Theory, 2007

Extensions of Bondys Theorem on Cycles in 2-Connected Graphs.

Ahmed Ainouche

Ars Comb., 2007

2006

Extension of several sufficient conditions for Hamiltonian graphs.

Ahmed Ainouche

Discuss. Math. Graph Theory, 2006

Hamilton connectedness and the partially square graphs.

Ahmed Ainouche, Serge Lapiquonne

Discret. Math., 2006

Relaxations of Ore's Condition on Cycles.

Ahmed Ainouche

Electron. J. Comb., 2006

2003

0-Dual Closures for Several Classes of Graphs.

Ahmed Ainouche, Ingo Schiermeyer

Graphs Comb., 2003

2001

Cycles in Partially Square Graphs.

Ahmed Ainouche, Mekkia Kouider

Graphs Comb., 2001

1999

Hamiltonism and Partially Square Graphs.

Ahmed Ainouche, Mekkia Kouider

Graphs Comb., 1999

1998

Global insertion and hamiltonicity in DCT-graphs.

Ahmed Ainouche, Odile Favaron, Hao Li

Discret. Math., 1998

Quasi-claw-free graphs.

Ahmed Ainouche

Discret. Math., 1998

1996

A short proof of a theorem on Hamiltonian graphs.

Ahmed Ainouche

J. Graph Theory, 1996

1995

Insertible vertices, neighborhood intersections, and hamiltonicity.

Ahmed Ainouche, Ingo Schiermeyer

J. Graph Theory, 1995

A common generalization of Chvátal-Erdös' and Fraisse's sufficient conditions for hamiltonian graphs.

Ahmed Ainouche

Discret. Math., 1995

1992

An improvement of fraisse's sufficient condition for hamiltonian graphs.

Ahmed Ainouche

J. Graph Theory, 1992

1991

Four sufficient conditions for hamiltonian graphs.

Ahmed Ainouche

Discret. Math., 1991

1987

Semi-independence number of a graph and the existence of Hamiltonian circuits.

Ahmed Ainouche, Nicos Christofides

Discret. Appl. Math., 1987

1981

Strong sufficient conditions for the existence of Hamiltonian circuits in undirected graphs.

Ahmed Ainouche, Nicos Christofides

J. Comb. Theory, Ser. B, 1981