In:
Canadian Mathematical Bulletin, Canadian Mathematical Society, Vol. 22, No. 3 ( 1979-09-01), p. 305-309
Abstract:
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.
Type of Medium:
Online Resource
ISSN:
0008-4395
,
1496-4287
DOI:
10.4153/CMB-1979-037-0
Language:
English
Publisher:
Canadian Mathematical Society
Publication Date:
1979
detail.hit.zdb_id:
1467412-9
SSG:
17,1
Permalink