Results 61 to 70 of about 2,059,443 (151)
International Journal of Mathematics and Mathematical Sciences, 2001 For an arbitrary undirected graph G, we are designing a logical model for the Hamiltonian Cycle Problem (HCP), using tools of Boolean algebra only. The obtained model is a logic formulation of the conditions for the existence of the Hamiltonian cycle ...
Anatoly D. Plotnikov
doaj +1 more source
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
A Note on Cycles in Locally Hamiltonian and Locally Hamilton-Connected Graphs
Discussiones Mathematicae Graph Theory, 2020 Let 𝒫 be a property of a graph. A graph G is said to be locally 𝒫, if the subgraph induced by the open neighbourhood of every vertex in G has property 𝒫. Ryjáček conjectures that every connected, locally connected graph is weakly pancyclic.
Tang Long, Vumar Elkin
doaj +1 more source
Symmetry classes of Hamiltonian cycles
CoRR27 pages, 13 ...
Júlia Baligács +3 more
openaire +4 more sources
Extending a perfect matching to a Hamiltonian cycle [PDF]
Discrete Mathematics & Theoretical Computer Science, 2015 Graph ...
Adel Alahmadi +5 more
doaj +1 more source
Ore-degree threshold for the square of a Hamiltonian cycle [PDF]
Discrete Mathematics & Theoretical Computer Science, 2015 Graph ...
Louis DeBiasio +2 more
doaj +1 more source
Oriented Hamiltonian Cycles in Tournaments
Journal of Combinatorial Theory, Series B, 2000 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +3 more sources
Hamiltonian cycles and travelling salesfolk
International Journal of Science and Research (IJSR), 2023 A method is given in this paper that makes it easier to solve both the Hamiltonian cycle problem and the travelling salesman problem in any number of space dimensions and in both their directed and undirected varieties.
openaire +1 more source
Hamiltonian cycle clustering with asymmetric correlation
Visual InformaticsAnalysts who explore high-dimensional data usually want three answers at once: Which samples belong together, how close the resulting groups are, and who influences whom accordingly.
Tianyi Huang +2 more
doaj +1 more source
On the Hamiltonian Number of a Plane Graph
Discussiones Mathematicae Graph Theory, 2019 The Hamiltonian number of a connected graph is the minimum of the lengths of the closed spanning walks in the graph. In 1968, Grinberg published a necessary condition for the existence of a Hamiltonian cycle in a plane graph, formulated in terms of the ...
Lewis Thomas M.
doaj +1 more source