Results 11 to 20 of about 841,975 (192)
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
Hamiltonian decompositions of products of cycles [PDF]
Discrete Mathematics, 1978 AbstractA graph is said to be decomposable into hamiltonian cycles if its edge set can be partitioned into hamiltonian cycles. We show that the cartesian product of any three cycles can be decomposed into three hamiltonian cycles, thus settling a conjecture by Kotzig.
Marsha F. Foregger, Foregger, Marsha F.
openaire +2 more sources
The Parity of Directed Hamiltonian Cycles [PDF]
2013 IEEE 54th Annual Symposium on Foundations of Computer Science, 2013 We present a deterministic algorithm that given any directed graph on n vertices computes the parity of its number of Hamiltonian cycles in O(1.619^n) time and polynomial space. For bipartite graphs, we give a 1.5^n poly(n) expected time algorithm. Our algorithms are based on a new combinatorial formula for the number of Hamiltonian cycles modulo a ...
Björklund, Andreas, Husfeldt, Thore
core +5 more sources
Graphs with few hamiltonian cycles
Mathematics of Computation, 2019 We describe an algorithm for the exhaustive generation of non-isomorphic graphs with a given number k ≥
Goedgebeur, Jan +2 more
openaire +4 more sources
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
On Extremal Hypergraphs for Hamiltonian Cycles [PDF]
Electronic Notes in Discrete Mathematics, 2011 We study sufficient conditions for Hamiltonian cycles in hypergraphs, and obtain both Turán- and Dirac-type results. While the Turán-type result gives an exact threshold for the appearance of a Hamiltonian cycle in a hypergraph depending only on the extremal number of a certain path, the Dirac-type result yields a sufficient condition relying solely on
Roman Glebov, Yury Person, Wilma Weps
openaire +5 more sources
Linear Hamiltonian behaviors and bilinear differential forms [PDF]
, 2004 We study linear Hamiltonian systems using bilinear and quadratic differential forms. Such a representation-free approach allows us to use the same concepts and techniques to deal with systems isolated from their environment and with systems subject to ...
Rapisarda, P. +7 more
core +3 more sources
Numerical evidence for phase transitions of NP-complete problems for instances drawn from Lévy-stable distributions [PDF]
, 2011 Random NP-Complete problems have come under study as an important tool used in the analysis of optimization algorithms and help in our understanding of how to properly address issues of computational intractability.
Connelly, Abram, Abram Connelly
core +2 more sources
Hamiltonian and Variational Linear Distributed Systems [PDF]
, 2002 We use the formalism of bilinear- and quadratic differential forms in order to study Hamiltonian and variational linear distributed systems. It was shown in [1] that a system described by ordinary linear constant-coefficient differential equations is ...
Rapisarda, P. +7 more
core +3 more sources
Enumerating Hamiltonian Cycles [PDF]
The Electronic Journal of Combinatorics, 2014 A dynamic programming method for enumerating hamiltonian cycles in arbitrary graphs is presented. The method is applied to grid graphs, king's graphs, triangular grids, and three-dimensional grid graphs, and results are obtained for larger cases than previously published.
openaire +5 more sources