Search    Browse

The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications of "Ahmed Ainouche" ( http://dblp.L3S.de/Authors/Ahmed_Ainouche )

  Author page on DBLP  Author page in RDF  Community of Ahmed Ainouche in ASPL-2

Publication years (Num. hits)
1981-2009 (16) 2012 (1)
Publication types (Num. hits)
article(17)
Venues (Conferences, Journals, ...)
Discrete Mathematics(8) Graphs and Combinatorics(4) Discussiones Mathematicae Grap...(2) Ars Comb.(1) Electr. J. Comb.(1) J. Comb. Theory, Ser. B(1)
Authors
Ahmed Ainouche(17) Mekkia Kouider(2) Serge Lapiquonne(2) Hao Li(1) Ingo Schiermeyer(1) Nicos Christofides(1) Odile Favaron(1)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
No Growbag Graphs found.
Results
Found 17 publication records. Showing 17 according to the selection in the facets
Hits ?▲ Authors Title Venue Year Link Author keywords
1Ahmed Ainouche alpha-degree closures for graphs. Search on Bibsonomy Discrete Mathematics The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Ahmed Ainouche beta-neighborhood closures for graphs. Search on Bibsonomy Discrete Mathematics The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Ahmed Ainouche beta-degree closures for graphs. Search on Bibsonomy Discrete Mathematics The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Ahmed Ainouche Dirac's Type Sufficient Conditions for Hamiltonicity and Pancyclicity. Search on Bibsonomy Graphs and Combinatorics The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Ahmed Ainouche, Serge Lapiquonne Variations on a sufficient condition for Hamiltonian graphs. Search on Bibsonomy Discussiones Mathematicae Graph Theory The full citation details ... 2007 DBLP  BibTeX  RDF
1Ahmed Ainouche Extensions of Bondys Theorem on Cycles in 2-Connected Graphs. Search on Bibsonomy Ars Comb. The full citation details ... 2007 DBLP  BibTeX  RDF
1Ahmed Ainouche, Serge Lapiquonne Hamilton connectedness and the partially square graphs. Search on Bibsonomy Discrete Mathematics The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Ahmed Ainouche Relaxations of Ore's Condition on Cycles. Search on Bibsonomy Electr. J. Comb. The full citation details ... 2006 DBLP  BibTeX  RDF
1Ahmed Ainouche Extension of several sufficient conditions for Hamiltonian graphs. Search on Bibsonomy Discussiones Mathematicae Graph Theory The full citation details ... 2006 DBLP  BibTeX  RDF
1Ahmed Ainouche, Ingo Schiermeyer 0-Dual Closures for Several Classes of Graphs. Search on Bibsonomy Graphs and Combinatorics The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
1Ahmed Ainouche, Mekkia Kouider Cycles in Partially Square Graphs. Search on Bibsonomy Graphs and Combinatorics The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
1Ahmed Ainouche, Mekkia Kouider Hamiltonism and Partially Square Graphs. Search on Bibsonomy Graphs and Combinatorics The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
1Ahmed Ainouche Quasi-claw-free graphs. Search on Bibsonomy Discrete Mathematics The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
1Ahmed Ainouche, Odile Favaron, Hao Li Global insertion and hamiltonicity in DCT-graphs. Search on Bibsonomy Discrete Mathematics The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
1Ahmed Ainouche A common generalization of Chvátal-Erdös' and Fraisse's sufficient conditions for hamiltonian graphs. Search on Bibsonomy Discrete Mathematics The full citation details ... 1995 DBLP  DOI  BibTeX  RDF
1Ahmed Ainouche Four sufficient conditions for hamiltonian graphs. Search on Bibsonomy Discrete Mathematics The full citation details ... 1991 DBLP  DOI  BibTeX  RDF
1Ahmed Ainouche, Nicos Christofides Strong sufficient conditions for the existence of Hamiltonian circuits in undirected graphs. Search on Bibsonomy J. Comb. Theory, Ser. B The full citation details ... 1981 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #17 of 17 (100 per page; Change: )
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.