Results 21 to 30 of about 5,066 (209)
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
On Hamiltonian Cycles in Claw-Free Cubic Graphs
Discussiones Mathematicae Graph Theory, 2022 We show that every claw-free cubic graph of order n at least 8 has at most 2⌊n4⌋{2^{\left\lfloor {{n \over 4}} \right\rfloor }} Hamiltonian cycles, and we also characterize all extremal graphs.
Mohr Elena, Rautenbach Dieter
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
Graphs with few hamiltonian cycles
Mathematics of Computation, 2019 29 pages; to appear in Mathematics of ...
Goedgebeur, Jan +2 more
openaire +2 more sources
Enforced hamiltonian cycles in generalized dodecahedra
Electronic Journal of Graph Theory and Applications, 2013 The H-force number of a hamiltonian graph G is the smallest number k with the property that there exists a set W ⊆ V (G) with |W| = k such that each cycle passing through all vertices of W is a hamiltonian cycle.
Maria Timkova
doaj +1 more source
Arc-Disjoint Hamiltonian Paths in Strong Round Decomposable Local Tournaments
Discussiones Mathematicae Graph Theory, 2021 Thomassen, [Edge-disjoint Hamiltonian paths and cycles in tournaments, J. Combin. Theory Ser. B 28 (1980) 142–163] proved that every strong tournament has a pair of arc-disjoint Hamiltonian paths with distinct initial vertices and distinct terminal ...
Meng Wei
doaj +1 more source
Tverberg’s Theorem, Disks, and Hamiltonian Cycles [PDF]
Annals of Combinatorics, 2021 8 pages, 3 ...
Pablo Soberón, Yaqian Tang
openaire +3 more sources
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
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.
Reay, J. R., Zamfirescu, T.
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