Geodesic
Relaxations of Ore's condition on cycles
The electronic journal of combinatorics, Tome 13 (2006)

Voir la notice de l'article provenant de la source The Electronic Journal of Combinatorics website

Zbl EuDML
A simple, undirected $2$-connected graph $G$ of order $n$ belongs to class ${\cal O}(n$,$\varphi)$, $\varphi\geq0$, if $\sigma_{2}=n-\varphi.$ It is well known (Ore's theorem) that $G$ is hamiltonian if $\varphi= 0$, in which case the $2$-connectedness hypothesis is implied. In this paper we provide a method for studying this class of graphs. As an application we give a full characterization of graphs $G$ in ${\cal O}(n$,$\varphi)$, $\varphi\leq3$, in terms of their dual hamiltonian closure.
DOI : 10.37236/1086
Classification : 05C45
Mots-clés : Hamiltonian, characterization 
Ahmed Ainouche. Relaxations of Ore's condition on cycles. The electronic journal of combinatorics, Tome 13 (2006). doi: 10.37236/1086
@article{10_37236_1086,
     author = {Ahmed Ainouche},
     title = {Relaxations of {Ore's} condition on cycles},
     journal = {The electronic journal of combinatorics},
     year = {2006},
     volume = {13},
     doi = {10.37236/1086},
     zbl = {1096.05031},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/1086/}
}
TY  - JOUR
AU  - Ahmed Ainouche
TI  - Relaxations of Ore's condition on cycles
JO  - The electronic journal of combinatorics
PY  - 2006
VL  - 13
UR  - http://geodesic.mathdoc.fr/articles/10.37236/1086/
DO  - 10.37236/1086
ID  - 10_37236_1086
ER  - 
%0 Journal Article
%A Ahmed Ainouche
%T Relaxations of Ore's condition on cycles
%J The electronic journal of combinatorics
%D 2006
%V 13
%U http://geodesic.mathdoc.fr/articles/10.37236/1086/
%R 10.37236/1086
%F 10_37236_1086

Cité par Sources :