%0 Journal Article
%T Hamilton-connected properties in cartesian product
%A Rushengul Hoshur
%A Elkin Vumar
%J Transactions on Combinatorics
%D 2012
%I University of Isfahan
%X 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$.
%K Cartesian product
%K Hamilton-connectedness
%K Hamilton cycle
%K Hamilton path
%U http://www.combinatorics.ir/?_action=showPDF&article=1871&_ob=ecca2020190157c7d415ed40662b73c2&fileName=full_text.pdf