Hamilton-connected properties in cartesian product

Transactions on Combinatorics

关键词: Cartesian product;    Hamilton-connectedness;    Hamilton cycle;    Hamilton path;   

DOI  :  

来源: DOAJ

【 摘 要 】

In this paper, we investigate a problem of finding natural condition to assure the product of two graphs to be hamilton-connected. We present some sufficient and necessary conditions for $GBox H$ being hamilton-connected when $G$ is a hamilton-connected graph and $H$ is a tree or $G$ is a hamiltonian graph and $H$ is $K_2$.

【 授权许可】

Unknown