20.500.12556/DKUM-96779 On prism-hamiltonian bipartite graphs A 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. graphs theory graph G teorija grafov graf G true false true University of Queensland, Australia Angleški jezik Slovenski jezik https://ajc.maths.uq.edu.au/ © The author(s) Članek v reviji 2026-01-28 13:17:23 2026-01-28 13:17:23 2026-01-29 03:11:48 0000-00-00 00:00:00 2024 0 0 str. 194-203 no. 2 Vol. 88 2024 0000-00-00 Zaloznikova Objavljeno NiDoloceno 2023-02-07 2024-01-17 2024-02-01 519.17 197089027 2202-3518 ajc_v88_p194.pdf ajc_v88_p194.pdf 1 3FB617856E917F5B3F38241DC35D7703 442cd389793efb13b58cd46665d102acac1ce700d08996f65ff2dd17338e8d59 f986566d-fc43-11f0-9a72-00155d00018d https://dk.um.si/Dokument.php?lang=slv&id=202691 https://ajc.maths.uq.edu.au/pdf/88/ajc_v88_p194.pdf 0 04fec0f1-fc44-11f0-9a72-00155d00018d https://dk.um.si/Dokument.php?lang=slv&id=202692 Fakulteta za strojništvo 0 0 0