Results 1 to 10 of about 77,334 (248)
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, 2014 A classic theorem of Dirac from 1952 states that every graph with minimum degree at least n/2 contains a Hamiltonian cycle. In 1963, P\'osa conjectured that every graph with minimum degree at least 2n/3 contains the square of a Hamiltonian cycle. In 1960,
DeBiasio, Louis +2 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
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
Finding Hamiltonian and Longest (s,t)-Paths of C-Shaped Supergrid Graphs in Linear Time
Algorithms, 2022 A graph is called Hamiltonian connected if it contains a Hamiltonian path between any two distinct vertices. In the past, we proved the Hamiltonian path and cycle problems for general supergrid graphs to be NP-complete.
Fatemeh Keshavarz-Kohjerdi, Ruo-Wei Hung
doaj +1 more source
Hamiltonian Cycle Problem in Strong k-Quasi-Transitive Digraphs With Large Diameter
Discussiones Mathematicae Graph Theory, 2021 Let k be an integer with k ≥ 2. A digraph is k-quasi-transitive, if for any path x0x1... xk of length k, x0 and xk are adjacent. Let D be a strong k-quasi-transitive digraph with even k ≥ 4 and diameter at least k +2.
Wang Ruixia
doaj +1 more source
Extending Complex Conjugate Control to Nonlinear Wave Energy Converters
Journal of Marine Science and Engineering, 2020 This paper extends the concept of Complex Conjugate Control (CCC) of linear wave energy converters (WECs) to nonlinear WECs by designing optimal limit cycles with Hamiltonian Surface Shaping and Power Flow Control (HSSPFC).
David G. Wilson +4 more
doaj +1 more source
Hamiltonian cycles in polyhedral maps [PDF]
Proceedings - Mathematical Sciences, 2017 14 ...
Maity, Dipendu, Upadhyay, Ashish Kumar
openaire +2 more sources
Proper Hamiltonian Cycles in Edge-Colored Multigraphs [PDF]
, 2017 A $c$-edge-colored multigraph has each edge colored with one of the $c$ available colors and no two parallel edges have the same color. A proper Hamiltonian cycle is a cycle containing all the vertices of the multigraph such that no two adjacent edges ...
Borozan, Valentin +4 more
core +5 more sources