Results 11 to 20 of about 382 (214)
Reducing the generalised Sudoku problem to the Hamiltonian cycle problem
AKCE International Journal of Graphs and Combinatorics, 2016 The generalised Sudoku problem with N symbols is known to be NP-complete, and hence is equivalent to any other NP-complete problem, even for the standard restricted version where N is a perfect square.
Michael Haythorpe
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
Andrei Z. Broder +2 more
openaire +1 more source
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
The Traveling Salesman Problem for Cubic Graphs
Journal of Graph Algorithms and Applications, 2007 We show how to find a Hamiltonian cycle in a graph of degree at most three with n vertices, in time O(2n/3) ≈ 1.260n and linear space. Our algorithm can find the minimum weight Hamiltonian cycle (traveling salesman problem), in the same time bound.
David Eppstein
doaj +1 more source
Limit cycles of planar piecewise linear Hamiltonian differential systems with two or three zones
Electronic Journal of Qualitative Theory of Differential Equations, 2022 In this paper, we study the existence of limit cycles in continuous and discontinuous planar piecewise linear Hamiltonian differential system with two or three zones separated by straight lines and such that the linear systems that define the piecewise ...
Claudio Pessoa, Ronisio Ribeiro
doaj +1 more source
Hamiltonian Cycles in T-Graphs [PDF]
Discrete & Computational Geometry, 2000 The vertices and polygonal edges of the planar Archimedean tiling \(3^6\) of the plane is called the triangular tiling graph (TTG). A subgraph \(G\) of TTG is linearly convex if, for every line \(L\) which contains an edge of TTG, the set \(L \cap G\) is a (possibly degenerated or empty) line segment.
John R. Reay, Tudor Zamfirescu
openaire +2 more sources
Grafos hamiltonianos en el diseño de viajes
Modelling in Science Education and Learning, 2013 The existence and, if applicable, the location of paths with given properties is a topic in graph theory. One of these problems is to find routes through all points, only once, starting and ending at the same node.
Cristina Jordán Lluch +1 more
doaj +1 more source
A remark on Hamiltonian cycles
Journal of Combinatorial Theory, Series B, 1981 AbstractEvery 2-connected graph G with δ ⩾ (v + κ)3 is hamiltonian where v denotes the order, δ the minimum degree and κ the point connectivity of G.
Roland Häggkvist, G. G. Nicoghossian
openaire +1 more source
Second Hamiltonian Cycles in Claw-Free Graphs
Theory and Applications of Graphs, 2015 Sheehan conjectured in 1975 that every Hamiltonian regular simple graph of even degree at least four contains a second Hamiltonian cycle. We prove that most claw-free Hamiltonian graphs with minimum degree at least 3 have a second Hamiltonian cycle and ...
Hossein Esfandiari +3 more
doaj +1 more source
Electronic Journal of Graph Theory and Applications, 2021 A Hamiltonian graph G = (V,E) is called hyper-Hamiltonian if G-v is Hamiltonian for any v ∈ V(G). G is called a circulant if its automorphism group contains a |V(G)|-cycle.
Zbigniew R. Bogdanowicz
doaj +1 more source