Results 51 to 60 of about 3,095,070 (339)
Long cycles in Hamiltonian graphs [PDF]
Israel Journal of Mathematics, 2018 15 pages, submitted, some typos ...
Teeradej Kittipassorn +2 more
openaire +3 more sources
An explicit construction of graphs of bounded degree that are far from being Hamiltonian [PDF]
Discrete Mathematics & Theoretical Computer Science, 2022 Hamiltonian cycles in graphs were first studied in the 1850s. Since then, an impressive amount of research has been dedicated to identifying classes of graphs that allow Hamiltonian cycles, and to related questions.
Isolde Adler, Noleen Köhler
doaj +1 more source
Hamiltonian Chains in Hypergraphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2005 Hamiltionian chain is a generalisation of hamiltonian cycles for hypergraphs. Among the several possible ways of generalisations this is probably the most strong one, it requires the strongest structure.
Gyula Y. Katona
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 ...
Carol T. Zamfirescu +2 more
openaire +3 more sources
Hybrid Algorithm of Sparrow Algorithm and Arithmetic Optimization Algorithm Based on Hamiltonian Graph [PDF]
Jisuanji kexue yu tansuo, 2023 Aiming at the shortcomings of sparrow search algorithm (SSA), such as decreased population diversity in the late iteration and easily falling into local optimal solution, a hybrid algorithm of sparrow search algorithm and arithmetic optimization ...
TIAN Lu, LIU Sheng
doaj +1 more source
Decomposing the Complete Graph Into Hamiltonian Paths (Cycles) and 3-Stars
Discussiones Mathematicae Graph Theory, 2020 Let H be a graph. A decomposition of H is a set of edge-disjoint subgraphs of H whose union is H. A Hamiltonian path (respectively, cycle) of H is a path (respectively, cycle) that contains every vertex of H exactly once.
Lee Hung-Chih, Chen Zhen-Chun
doaj +1 more source
HybridHAM: A Novel Hybrid Heuristic for Finding Hamiltonian Cycle
Journal of Optimization, 2018 Hamiltonian Cycle Problem is one of the most explored combinatorial problems. Being an NP-complete problem, heuristic approaches are found to be more powerful than exponential time exact algorithms.
K. R. Seeja
semanticscholar +1 more source
The parity Hamiltonian cycle problem
Discrete Mathematics, 2018 Motivated by a relaxed notion of the celebrated Hamiltonian cycle, this paper investigates its variant, parity Hamiltonian cycle (PHC): A PHC of a graph is a closed walk which visits every vertex an odd number of times, where we remark that the walk may use an edge more than once. First, we give a complete characterization of the graphs which have PHCs,
Yusuke Kobayashi +4 more
openaire +3 more sources
A Note Concerning Hamilton Cycles in Some Classes of Grid Graphs
Journal of Mathematical and Fundamental Sciences, 2013 A graph G is called hamiltonian if it contains a Hamilton cycle, i.e. a cycle containing all vertices. Deciding whether a given graph has a Hamilton cycle is an NP-complete problem. But, it is a polynomial problem within some special graph classes.
A. N.M. Salman +2 more
doaj +1 more source