Geodesic
Extension of several sufficient conditions for Hamiltonian graphs
Discussiones Mathematicae. Graph Theory, Tome 26 (2006) no. 1, pp. 23-39

Voir la notice de l'article provenant de la source Library of Science

Let G be a 2-connected graph of order n. Suppose that for all 3-independent sets X in G, there exists a vertex u in X such that |N(X∖u)|+d(u) ≥ n-1. Using the concept of dual closure, we prove that
Keywords: hamiltonian graph, dual closure, neighborhood closure 
@article{DMGT_2006_26_1_a2,
     author = {Ainouche, Ahmed},
     title = {Extension of several sufficient conditions for {Hamiltonian} graphs},
     journal = {Discussiones Mathematicae. Graph Theory},
     pages = {23--39},
     publisher = {mathdoc},
     volume = {26},
     number = {1},
     year = {2006},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/DMGT_2006_26_1_a2/}
}
TY  - JOUR
AU  - Ainouche, Ahmed
TI  - Extension of several sufficient conditions for Hamiltonian graphs
JO  - Discussiones Mathematicae. Graph Theory
PY  - 2006
SP  - 23
EP  - 39
VL  - 26
IS  - 1
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DMGT_2006_26_1_a2/
LA  - en
ID  - DMGT_2006_26_1_a2
ER  - 
%0 Journal Article
%A Ainouche, Ahmed
%T Extension of several sufficient conditions for Hamiltonian graphs
%J Discussiones Mathematicae. Graph Theory
%D 2006
%P 23-39
%V 26
%N 1
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DMGT_2006_26_1_a2/
%G en
%F DMGT_2006_26_1_a2
Ainouche, Ahmed. Extension of several sufficient conditions for Hamiltonian graphs. Discussiones Mathematicae. Graph Theory, Tome 26 (2006) no. 1, pp. 23-39. http://geodesic.mathdoc.fr/item/DMGT_2006_26_1_a2/