On prism-hamiltonian bipartite graphsŠpacapan, Simon (Avtor) Horak, Peter (Avtor) graphs theorygraph GA graph G is prism-hamiltonian if the prism over G, the Cartesian product of G with the complete graph K2, is hamiltonian. In this article a characterization of prism-hamiltonian graphs is provided. Kaiser et al. conjectured that every graph with sufficiently high toughness is prismhamiltonian. We prove a special case of this conjecture, namely that every 1-tough bipartite graph which has no adjacent vertices of degree at least four is prism-hamiltonian.University of Queensland, Australia 20242026-01-28 13:17:23Članek v reviji96779sl© The author(s)