Product
Help
Pricing
About
Jobs
Log in
Get started
Author
Add to collection
Ahmed Ainouche
Observed name:
A. Ainouche
Institution:
University of Sciences and Technology Houari Boumediene
Observed institutions:
University of Sciences and Technology Houari Boumediene,
Université des Antilles et de la Guyane,
Université des Antilles et de la Guyane,
Imperial College London
OpenAlex ID:
A5005823159
The pentagon of vulnerability and resilience: A methodological proposal in development economics by using graph theory
2014
·
Samuel Bates
, Valérie Angeon
, et al.
·
Economic Modelling
·
58
Quasi-claw-free graphs
1998
·
A. Ainouche
·
Discrete Mathematics
·
30
Conditions for the Existence of Hamiltonian Circuits in Graphs Based on Vertex Degrees
1985
·
Ahmed Ainouche
, Nicos Christofides
·
Journal of the London Mathematical Society
·
24
An improvement of fraisse's sufficient condition for hamiltonian graphs
1992
·
A. Ainouche
·
Journal of Graph Theory
·
23
Semi-independence number of a graph and the existence of Hamiltonian circuits
1987
·
Ahmed Ainouche
, Nicos Christofides
·
Discrete Applied Mathematics
·
21
Remarks on hamiltonian properties of claw-free graphs
1990
·
Ahmed Ainouche
, Hajo Broersma
, et al.
·
Ars Combinatoria
·
20
Strong sufficient conditions for the existence of Hamiltonian circuits in undirected graphs
1981
·
Ahmed Ainouche
, Nicos Christofides
·
Journal of Combinatorial Theory Series B
·
16
Hamiltonism and Partially Square Graphs
1999
·
Ahmed Ainouche
, Mekkia Kouider
·
Graphs and Combinatorics
·
9
A common generalization of Chvátal-Erdős' and Fraisse's sufficient conditions for hamiltonian graphs
1995
·
A. Ainouche
·
Discrete Mathematics
·
9
PDF
Insertible vertices, neighborhood intersections, and hamiltonicity
1995
·
A. Ainouche
, I. Schiermeyer
·
Journal of Graph Theory
·
8
Global insertion and hamiltonicity in DCT-graphs
1998
·
A. Ainouche
, O. Favaron
, et al.
·
Discrete Mathematics
·
7
0-Dual Closures for Several Classes of Graphs
2003
·
Ahmed Ainouche
, Ingo Schiermeyer
·
Graphs and Combinatorics
·
5
Four sufficient conditions for hamiltonian graphs
1991
·
A. Ainouche
·
Discrete Mathematics
·
4
Connectivity, independent sets and maximal circuits in undirected graphs
1981
·
Ahmed Ainouche
·
Spiral (Imperial College London)
·
4
The Pentagon of Vulnerability and Resilience: A Methodological Proposal in Development Economics Using Graph Theory
2013
·
Samuel Bates
, Vallrie Angeon
, et al.
·
SSRN Electronic Journal
·
3
Dirac’s Type Sufficient Conditions for Hamiltonicity and Pancyclicity
2009
·
Ahmed Ainouche
·
Graphs and Combinatorics
·
3
β -neighborhood closures for graphs
2008
·
Ahmed Ainouche
·
Discrete Mathematics
·
3
PDF
Extension of several sufficient conditions for Hamiltonian graphs
2006
·
Ahmed Ainouche
·
Discussiones Mathematicae Graph Theory
·
3
β -degree closures for graphs
2008
·
Ahmed Ainouche
·
Discrete Mathematics
·
2
PDF
Extensions of Bondys Theorem on Cycles in 2-Connected Graphs.
2007
·
Ahmed Ainouche
·
Ars Combinatoria
·
1
Hamilton connectedness and the partially square graphs
2006
·
Ahmed Ainouche
, Serge Lapiquonne
·
Discrete Mathematics
·
1
Geological Characterization of the Bir Djeneb’s Sinkhole (Boukadir, Algeria)
2023
·
Abdalhak Mahdjoub
, Ahmed Zeghari
, et al.
·
Research Square
PDF
On suficient conditions involving distances for hamiltonian properties in graphs
2013
·
Ahmed Ainouche
·
RePEc: Research Papers in Economics
α -degree closures for graphs
2011
·
Ahmed Ainouche
·
Discrete Mathematics
PDF
Variations on a sufficient condition for Hamiltonian graphs
2007
·
Ahmed Ainouche
, Serge Lapiquonne
·
Discussiones Mathematicae Graph Theory
Show more works
View as search
Works count:
28
Citation count:
254
H-index:
9
I10-index:
7
Year
Topic
Type