Geodesic
Hamiltonian Cycles in Strong Products of Graphs
Canadian mathematical bulletin, Tome 22 (1979) no. 3, pp. 305-309

Voir la notice de l'article provenant de la source Cambridge

DOI

Abstract. Let denote the graph (k times) where is the strong product of the two graphs G and H. In this paper we prove the conjecture of J. Zaks [3]: For every connected graph G with at least two vertices there exists an integer k = k(G) for which the graph is hamiltonian. 
Bermond, J. C.; Germa, A.; Heydemann, M. C. Hamiltonian Cycles in Strong Products of Graphs. Canadian mathematical bulletin, Tome 22 (1979) no. 3, pp. 305-309. doi: 10.4153/CMB-1979-037-0
@article{10_4153_CMB_1979_037_0,
     author = {Bermond, J. C. and Germa, A. and Heydemann, M. C.},
     title = {Hamiltonian {Cycles} in {Strong} {Products} of {Graphs}},
     journal = {Canadian mathematical bulletin},
     pages = {305--309},
     year = {1979},
     volume = {22},
     number = {3},
     doi = {10.4153/CMB-1979-037-0},
     url = {http://geodesic.mathdoc.fr/articles/10.4153/CMB-1979-037-0/}
}
TY  - JOUR
AU  - Bermond, J. C.
AU  - Germa, A.
AU  - Heydemann, M. C.
TI  - Hamiltonian Cycles in Strong Products of Graphs
JO  - Canadian mathematical bulletin
PY  - 1979
SP  - 305
EP  - 309
VL  - 22
IS  - 3
UR  - http://geodesic.mathdoc.fr/articles/10.4153/CMB-1979-037-0/
DO  - 10.4153/CMB-1979-037-0
ID  - 10_4153_CMB_1979_037_0
ER  - 
%0 Journal Article
%A Bermond, J. C.
%A Germa, A.
%A Heydemann, M. C.
%T Hamiltonian Cycles in Strong Products of Graphs
%J Canadian mathematical bulletin
%D 1979
%P 305-309
%V 22
%N 3
%U http://geodesic.mathdoc.fr/articles/10.4153/CMB-1979-037-0/
%R 10.4153/CMB-1979-037-0
%F 10_4153_CMB_1979_037_0

Cité par Sources :