Results 11 to 20 of about 77,334 (248)
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
Infinitely many nonsolvable groups whose Cayley graphs are hamiltonian [PDF]
, 2015 This note shows there are infinitely many finite groups G, such that every connected Cayley graph on G has a hamiltonian cycle, and G is not solvable. Specifically, for every prime p that is congruent to 1, modulo 30, we show there is a hamiltonian cycle
Morris, Dave Witte
core +4 more sources
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
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
Types of triangle in plane Hamiltonian triangulations and applications to domination and k-walks [PDF]
, 2019 We investigate the minimum number t(0)(G) of faces in a Hamiltonian triangulation G so that any Hamiltonian cycle C of G has at least t(0)(G) faces that do not contain an edge of C.
Brinkmann, Gunnar +2 more
core +2 more sources
Graphs with few hamiltonian cycles
Mathematics of Computation, 2019 29 pages; to appear in Mathematics of ...
Goedgebeur, Jan +2 more
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
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
On Vertices Enforcing a Hamiltonian Cycle
Discussiones Mathematicae Graph Theory, 2013 A nonempty vertex set X ⊆ V (G) of a hamiltonian graph G is called an H-force set of G if every X-cycle of G (i.e. a cycle of G containing all vertices of X) is hamiltonian.
Fabrici Igor +2 more
doaj +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