Results 1 to 10 of about 76,992 (320)
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 +5 more sources
On Vertices Enforcing a Hamiltonian Cycle [PDF]
Discussiones Mathematicae Graph Theory, 2013 A nonempty vertex set X ⊆ V (G) of a hamiltonian graph G is called an H-force set of G if every X-cycle of G (i.e. a cycle of G containing all vertices of X) is hamiltonian.
Fabrici Igor +2 more
doaj +4 more sources
Finding hidden hamiltonian cycles [PDF]
Random Structures & Algorithms, 1994 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
Andrei Broder, Alan Frieze, Eli Shamir
openalex +3 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
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
Ore-degree threshold for the square of a Hamiltonian cycle [PDF]
Discrete Mathematics & Theoretical Computer Science, 2015 Graph ...
Louis DeBiasio +2 more
doaj +6 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 +4 more sources
Hamiltonian cycles in Cayley graphs of imprimitive complex reflection groups [PDF]
, 2014 Generalizing a result of Conway, Sloane, and Wilkes for real reflection groups, we show the Cayley graph of an imprimitive complex reflection group with respect to standard generating reflections has a Hamiltonian cycle.
Kriloff, Cathy, Lay, Terry
core +3 more sources
Removable matchings and hamiltonian cycles
Discrete Mathematics, 2008 AbstractFor a graph G, let σ2(G) denote the minimum degree sum of two nonadjacent vertices (when G is complete, we let σ2(G)=∞). In this paper, we show the following two results: (i) Let G be a graph of order n≥4k+3 with σ2(G)≥n and let F be a matching of size k in G such that G−F is 2-connected.
Zhiquan Hu, Hao Li
openalex +3 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