default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAhmed Ainouche
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2012
[j21]Ahmed Ainouche:
alpha-degree closures for graphs. Discret. Math. 312(2): 390-396 (2012)
2000 – 2009
- 2009
- [j20]Ahmed Ainouche:
beta-neighborhood closures for graphs. Discret. Math. 309(10): 2961-2967 (2009) - [j19]Ahmed Ainouche:
beta-degree closures for graphs. Discret. Math. 309(10): 2968-2973 (2009) - [j18]Ahmed Ainouche:
Dirac's Type Sufficient Conditions for Hamiltonicity and Pancyclicity. Graphs Comb. 25(2): 129-137 (2009) - 2007
- [j17]Ahmed Ainouche:
Extensions of Bondys Theorem on Cycles in 2-Connected Graphs. Ars Comb. 85 (2007) - [j16]Ahmed Ainouche, Serge Lapiquonne:
Variations on a sufficient condition for Hamiltonian graphs. Discuss. Math. Graph Theory 27(2): 229-240 (2007) - 2006
- [j15]Ahmed Ainouche:
Relaxations of Ore's Condition on Cycles. Electron. J. Comb. 13(1) (2006) - [j14]Ahmed Ainouche, Serge Lapiquonne:
Hamilton connectedness and the partially square graphs. Discret. Math. 306(12): 1097-1104 (2006) - [j13]Ahmed Ainouche:
Extension of several sufficient conditions for Hamiltonian graphs. Discuss. Math. Graph Theory 26(1): 23-39 (2006) - 2003
- [j12]Ahmed Ainouche, Ingo Schiermeyer:
0-Dual Closures for Several Classes of Graphs. Graphs Comb. 19(3): 297-307 (2003) - 2001
- [j11]Ahmed Ainouche, Mekkia Kouider:
Cycles in Partially Square Graphs. Graphs Comb. 17(1): 1-9 (2001)
1990 – 1999
- 1999
- [j10]Ahmed Ainouche, Mekkia Kouider:
Hamiltonism and Partially Square Graphs. Graphs Comb. 15(3): 257-265 (1999) - 1998
- [j9]Ahmed Ainouche:
Quasi-claw-free graphs. Discret. Math. 179(1-3): 13-26 (1998) - [j8]Ahmed Ainouche, Odile Favaron, Hao Li:
Global insertion and hamiltonicity in DCT-graphs. Discret. Math. 184(1-3): 1-13 (1998) - 1996
- [j7]Ahmed Ainouche:
A short proof of a theorem on Hamiltonian graphs. J. Graph Theory 22(1): 83-87 (1996) - 1995
- [j6]Ahmed Ainouche:
A common generalization of Chvátal-Erdös' and Fraisse's sufficient conditions for hamiltonian graphs. Discret. Math. 142(1-3): 1-19 (1995) - [j5]Ahmed Ainouche, Ingo Schiermeyer:
Insertible vertices, neighborhood intersections, and hamiltonicity. J. Graph Theory 20(2): 123-135 (1995) - 1992
- [j4]Ahmed Ainouche:
An improvement of fraisse's sufficient condition for hamiltonian graphs. J. Graph Theory 16(6): 529-543 (1992) - 1991
- [j3]Ahmed Ainouche:
Four sufficient conditions for hamiltonian graphs. Discret. Math. 89(2): 195-200 (1991)
1980 – 1989
- 1987
- [j2]Ahmed Ainouche, Nicos Christofides:
Semi-independence number of a graph and the existence of Hamiltonian circuits. Discret. Appl. Math. 17(3): 213-221 (1987) - 1981
- [j1]Ahmed Ainouche, Nicos Christofides:
Strong sufficient conditions for the existence of Hamiltonian circuits in undirected graphs. J. Comb. Theory B 31(3): 339-343 (1981)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 20:30 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
