HAMILTONSKOST KARTEZIČNEGA PRODUKTA GRAFOV
Povzetek
Graf je Hamiltonov, če vsebuje cikel, ki gre skozi vsako vozlišče natanko enkrat. V tem članku preučujemo hamiltonskost kartezičnega produkta drevesa in poti. Podamo zadostne pogoje, da bo kartezični produkt drevesa in poti Hamiltonov.
Prenosi
Literatura
V. Batagelj, T. Pisanski: Hamiltonian cycle in the cartesian product of a tree and a cycle, Discrete Math. 38, 311 – 312, 1982
R. Čada, E. Flandrin, H. Li: Hamiltonicity and pancyclicity of cartesian products of graphs, Discrete Math. 309, 6337 – 6343, 1987
V. Dimakopoulos, L. Palios, A. S. Poulakidas: On the Hamiltonicity of the Cartesian product, Inform. Process. Lett. 96, 49 – 53, 2005
L. Kao, C. Weng: The Relation Between Hamiltonian and 1-Tough Properties of the Cartesian Product Graphs, Graphs Comb., 2020
M. Rosenfeld, D. Barnette: Hamiltonian circuits in certain prisms, Discrete Math. 5, 389394, 1973
