Results 1 to 10 of about 52,480 (200)
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
Contractible Hamiltonian Cycles in Polyhedral Maps [PDF]
Discrete Mathematics, Algorithms and Applications, 2012 We present a necessary and sufficient condition for existence of a contractible Hamiltonian Cycle in the edge graph of equivelar maps on surfaces. We also present an algorithm to construct such cycles.
Maity, Dipendu, Upadhyay, Ashish Kumar
core +2 more sources
Hamiltonian Cycles in Polyhedral Maps [PDF]
Proceedings - Mathematical Sciences, 2014 We present a necessary and sufficient condition for existence of a contractible, non-separating and noncontractible separating Hamiltonian cycle in the edge graph of polyhedral maps on surfaces.
Maity, Dipendu, Upadhyay, Ashish Kumar
core +3 more sources
Hamiltonian Cycles on Random Eulerian Triangulations [PDF]
Nuclear Physics B, 1998 A random Eulerian triangulation is a random triangulation where an even number of triangles meet at any given vertex. We argue that the central charge increases by one if the fully packed O(n) model is defined on a random Eulerian triangulation instead ...
Ambjorn +38 more
core +5 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
Hamiltonian cycles in torical lattices [PDF]
Discrete Mathematics & Theoretical Computer Science, 2005 We establish sufficient conditions for a toric lattice $T_{m,n}$ to be Hamiltonian. Also, we give some asymptotics for the number of Hamiltonian cycles in $T_{m,n}$.
Vladimir K. Leontiev
doaj +1 more source
An explicit construction of graphs of bounded degree that are far from being Hamiltonian [PDF]
Discrete Mathematics & Theoretical Computer Science, 2022 Hamiltonian cycles in graphs were first studied in the 1850s. Since then, an impressive amount of research has been dedicated to identifying classes of graphs that allow Hamiltonian cycles, and to related questions.
Isolde Adler, Noleen Köhler
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
Counting Hamiltonian Cycles in 2-Tiled Graphs
Mathematics, 2021 In 1930, Kuratowski showed that K3,3 and K5 are the only two minor-minimal nonplanar graphs. Robertson and Seymour extended finiteness of the set of forbidden minors for any surface.
Alen Vegi Kalamar +2 more
doaj +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