Ahmed Ainouche

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

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2012
alpha-degree closures for graphs.
Discret. Math., 2012

2009
Dirac's Type Sufficient Conditions for Hamiltonicity and Pancyclicity.
Graphs Comb., 2009

beta-degree closures for graphs.
Discret. Math., 2009

beta-neighborhood closures for graphs.
Discret. Math., 2009

2007
Variations on a sufficient condition for Hamiltonian graphs.
Discuss. Math. Graph Theory, 2007

Extensions of Bondys Theorem on Cycles in 2-Connected Graphs.
Ars Comb., 2007

2006
Extension of several sufficient conditions for Hamiltonian graphs.
Discuss. Math. Graph Theory, 2006

Hamilton connectedness and the partially square graphs.
Discret. Math., 2006

Relaxations of Ore's Condition on Cycles.
Electron. J. Comb., 2006

2003
0-Dual Closures for Several Classes of Graphs.
Graphs Comb., 2003

2001
Cycles in Partially Square Graphs.
Graphs Comb., 2001

1999
Hamiltonism and Partially Square Graphs.
Graphs Comb., 1999

1998
Global insertion and hamiltonicity in DCT-graphs.
Discret. Math., 1998

Quasi-claw-free graphs.
Discret. Math., 1998

1996
A short proof of a theorem on Hamiltonian graphs.
J. Graph Theory, 1996

1995
Insertible vertices, neighborhood intersections, and hamiltonicity.
J. Graph Theory, 1995

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

1992
An improvement of fraisse's sufficient condition for hamiltonian graphs.
J. Graph Theory, 1992

1991
Four sufficient conditions for hamiltonian graphs.
Discret. Math., 1991

1987
Semi-independence number of a graph and the existence of Hamiltonian circuits.
Discret. Appl. Math., 1987

1981
Strong sufficient conditions for the existence of Hamiltonian circuits in undirected graphs.
J. Comb. Theory B, 1981


  Loading...