Results 1 to 10 of about 78,303 (310)
Hamiltonian cycles and travelling salesfolk [PDF]
International Journal of Science and Research (IJSR), 2023 A method is given in this paper that makes it easier to solve both the Hamiltonian cycle problem and the travelling salesman problem in any number of space dimensions and in both their directed and undirected varieties.
Alberto Gomez Gomez
openalex +2 more sources
Complexity of Hamiltonian Cycle Reconfiguration [PDF]
Algorithms, 2018 The Hamiltonian cycle reconfiguration problem asks, given two Hamiltonian cycles C 0 and C t of a graph G, whether there is a sequence of Hamiltonian cycles C 0 , C 1 , … , C t such that C i can be obtained ...
Asahi Takaoka
doaj +2 more sources
Enumeration of Hamiltonian Cycles on a Thick Grid Cylinder -- Part II:\n Contractible Hamiltonian Cycles [PDF]
Applicable Analysis and Discrete Mathematics, 2021 In a recent paper, we have studied the enumeration of Hamiltonian cycles (abbreviated HCs) on the grid cylinder graph Pm+1 x Cn, where m grows while n is fixed. In this sequel, we study a much harder problem of enumerating HCs on the same graph only this time letting n grow while m is fixed.
Olga Bodroža-Pantić +4 more
openalex +5 more sources
Symmetry classes of Hamiltonian cycles [PDF]
27 pages, 13 ...
Julia Baligacs +3 more
openalex +4 more sources
On Pedigree Polytopes and Hamiltonian Cycles
Discrete Mathematics, 2003 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Tim S. Arthanari
openalex +5 more sources
Oriented Hamiltonian Cycles in Tournaments
Journal of Combinatorial Theory, Series B, 2000 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Frédéric Havet
openalex +5 more sources
Hamiltonian cycles on random Eulerian triangulations [PDF]
Nuclear Physics B, 1999 22 pages, 9 figures, references and a comment ...
E Guitter, C Kristjansen, J.L Nielsen
openalex +6 more sources
Counting Traversing Hamiltonian Cycles in Tiled Graphs
Mathematics, 2023 Recently, the problem of counting Hamiltonian cycles in 2-tiled graphs was resolved by Vegi Kalamar, Bokal, and Žerak. In this paper, we continue our research on generalized tiled graphs.
Alen Vegi Kalamar
doaj +1 more source
Finding hidden hamiltonian cycles [PDF]
Random Structures & Algorithms, 1991 AbstractConsider a random graph G composed of a Hamiltonian cycle on n labeled vertices and dn random edges that “high” the cycle. Is it possible to unravel the structures, that is, to efficiently find a Himiltonian cycle in G? We describe an O(n3 log n)‐step algorithm A for this purpose, and prove that it succeeds almost surely. Part one of A properly
Broder, Andrei Z. +2 more
openaire +1 more source
Discrete Mathematics, 2022 If the line graph of a graph $G$ decomposes into Hamiltonian cycles, what is $G$? We answer this question for decomposition into two cycles.
Vaidy Sivaraman, Thomas Zaslavsky
openaire +3 more sources