Results 11 to 20 of about 3,188,937 (280)
Enumeration of Hamiltonian cycles on a thick grid cylinder - part I: Non-contractible Hamiltonian cycles [PDF]
Applicable Analysis and Discrete Mathematics, 2019 In a recent paper, we have studied the enumeration of Hamiltonian cycles (abbreviated HCs) on the grid cylinder graph Pm+1 x Cn, where m grows while n is fixed. In this sequel, we study a much harder problem of enumerating HCs on the same graph only this
O. Bodroža-Pantić +3 more
semanticscholar +6 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
Symmetry classes of Hamiltonian cycles [PDF]
27 pages, 13 ...
Baligács, Júlia +3 more
openaire +4 more sources
On pre-Hamiltonian Cycles in Hamiltonian Digraphs [PDF]
, 2014 Let $D$ be a strongly connected directed graph of order $n\geq 4$. In \cite{[14]} (J. of Graph Theory, Vol.16, No. 5, 51-59, 1992) Y. Manoussakis proved the following theorem: Suppose that $D$ satisfies the following condition for every triple $x,y,z$ of vertices such that $x$ and $y$ are non-adjacent: If there is no arc from $x$ to $z$, then $d(x)+d(y)
Samvel Kh. Darbinyan
openaire +3 more sources
Hamiltonian Cycles on Ammann-Beenker Tilings [PDF]
Physical Review X, 2023 We provide a simple algorithm for constructing Hamiltonian graph cycles (visiting every vertex exactly once) on a set of arbitrarily large finite subgraphs of aperiodic two-dimensional Ammann-Beenker (AB) tilings.
Shobhna Singh, J. Lloyd, F. Flicker
semanticscholar +1 more source
Algorithmic QUBO formulations for k-SAT and hamiltonian cycles [PDF]
GECCO Companion, 2022 Quadratic Unconstrained Binary Optimization (QUBO) can be seen as a generic language for optimization problems. QUBOs attract particular attention since they can be solved with quantum hardware, like quantum annealers or quantum gate computers running ...
Jonas Nusslein +3 more
semanticscholar +1 more source
A Fully Adaptive Strategy for Hamiltonian Cycles in the Semi-Random Graph Process [PDF]
International Workshop and International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 2022 The semi-random graph process is a single player game in which the player is initially presented an empty graph on $n$ vertices. In each round, a vertex $u$ is presented to the player independently and uniformly at random.
Pu Gao, Calum MacRury, P. Prałat
semanticscholar +1 more source
Powers of Hamiltonian cycles in randomly augmented Dirac graphs—The complete collection [PDF]
Journal of Graph Theory, 2022 We study the powers of Hamiltonian cycles in randomly augmented Dirac graphs, that is, n $n$ ‐vertex graphs G $G$ with minimum degree at least (1∕2+ε)n $(1\unicode{x02215}2+\varepsilon )n$ to which some random edges are added.
Sylwia Antoniuk, A. Dudek, A. Ruci'nski
semanticscholar +1 more source
Few hamiltonian cycles in graphs with one or two vertex degrees [PDF]
arXiv.org, 2022 We fully disprove a conjecture of Haythorpe on the minimum number of hamiltonian cycles in regular hamiltonian graphs, thereby extending a result of Zamfirescu, as well as correct and complement Haythorpe’s computational enumerative results from [ Ex ...
J. Goedgebeur +4 more
semanticscholar +1 more source
Counting Hamiltonian Cycles in 2-Tiled Graphs [PDF]
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 +14 more
semanticscholar +1 more source