Results 21 to 30 of about 3,095,070 (339)
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 ...
Wilma Weps, Roman Glebov, Yury Person
openaire +4 more sources
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
Distribution System State Estimation Using the Hamiltonian Cycle Theory
IEEE Transactions on Smart Grid, 2015 Jônatas Boás Leite +1 more
openalex +3 more sources
Hidden Hamiltonian Cycle Recovery via Linear Programming [PDF]
Operational Research, 2018 We introduce the problem of hidden Hamiltonian cycle recovery, where there is an unknown Hamiltonian cycle in an $n$-vertex complete graph that needs to be inferred from noisy edge measurements.
V. Bagaria +4 more
semanticscholar +1 more source
Looking for the Hardest Hamiltonian Cycle Problem Instances
International Joint Conference on Computational Intelligence, 2020 : We use two evolutionary algorithms to make hard instances of the Hamiltonian cycle problem. Hardness, or fitness, is defined as the number of recursions required by Vandegriend-Culberson, the best known exact backtracking algorithm for the problem.
J. Sleegers, D. V. D. Berg
semanticscholar +1 more source
An Optimal XP Algorithm for Hamiltonian Cycle on Graphs of Bounded Clique-Width [PDF]
Algorithmica, 2017 In this paper, we prove that, given a clique-width k-expression of an n-vertex graph, Hamiltonian Cycle can be solved in time nO(k)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb ...
Benjamin Bergougnoux +2 more
semanticscholar +1 more source
A note on equitable Hamiltonian cycles
Discrete Applied Mathematics, 2021 Given a complete graph with an even number of vertices, and with each edge colored with one of two colors (say red or blue), an equitable Hamiltonian cycle is a Hamiltonian cycle that can be decomposed into two perfect matchings such that both perfect matchings have the same number of red edges.
Tim Ophelders +3 more
openaire +2 more sources
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
Existence of Dλ-cycles and Dλ-paths [PDF]
, 1983 A cycle of C of a graph G is called a Dλ-cycle if every component of G − V(C) has order less than λ. A Dλ-path is defined analogously. In particular, a D1-cycle is a hamiltonian cycle and a D1-path is a hamiltonian path.
Veldman, H.J.
core +4 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 +4 more sources