Results 31 to 40 of about 3,095,070 (339)
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
On Hamiltonicity of {claw, net}-free graphs [PDF]
, 2006 An st-path is a path with the end-vertices s and t. An s-path is a path with an end-vertex s. The results of this paper include necessary and sufficient conditions for a {claw, net}-free graph G with given two different vertices s, t and an edge e to ...
Kelmans, Alexander
core +3 more sources
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.
G.G Nicoghossian, Roland Häggkvist
openaire +2 more sources
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
Limit cycle bifurcations of near-Hamiltonian systems with multiple switching curves and applications
Discrete & Continuous Dynamical Systems - S, 2022 In the present paper, we are devoted to the study of limit cycle bifurcations in piecewise smooth near-Hamiltonian systems with multiple switching curves, obtaining a formula of the first order Melnikov function in general case.
Wenye Liu, Maoan Han
semanticscholar +1 more source
The Parity of Directed Hamiltonian Cycles [PDF]
2013 IEEE 54th Annual Symposium on Foundations of Computer Science, 2013 We present a deterministic algorithm that given any directed graph on n vertices computes the parity of its number of Hamiltonian cycles in O(1.619^n) time and polynomial space. For bipartite graphs, we give a 1.5^n poly(n) expected time algorithm. Our algorithms are based on a new combinatorial formula for the number of Hamiltonian cycles modulo a ...
Björklund, Andreas, Husfeldt, Thore
openaire +3 more sources
Hamiltonian and pseudo-Hamiltonian cycles and fillings in simplicial complexes [PDF]
Journal of Combinatorial Theory, Series B, 2021 We introduce and study a $d$-dimensional generalization of Hamiltonian cycles in graphs - the Hamiltonian $d$-cycles in $K_n^d$ (the complete simplicial $d$-complex over a vertex set of size $n$). Those are the simple $d$-cycles of a complete rank, or, equivalently, of size $1 + {{n-1} \choose d}$.
Rogers Mathew +3 more
openaire +4 more sources
Enumerating Hamiltonian Cycles in a Planar Graph Using Combinatorial Cycle Bases
Journal of Applied Computer Science & Mathematics, 2016 Cycle bases belong to a k-connected simple graph used both for listing and enumerating Hamiltonian cycles contained in a planar graph. Planar cycle bases have a weighted induced graph whose weight values limited to 1.
Retno MAHARESI
doaj +1 more source
Random Walk in a N-Cube Without Hamiltonian Cycle to Chaotic Pseudorandom Number Generation: Theoretical and Practical Considerations [PDF]
International Journal of Bifurcation and Chaos in Applied Sciences and Engineering, 2017 Designing a pseudorandom number generator (PRNG) is a difficult and complex task. Many recent works have considered chaotic functions as the basis of built PRNGs: the quality of the output would indeed be an obvious consequence of some chaos properties ...
S. Contassot-Vivier +3 more
semanticscholar +1 more source