Results 11 to 20 of about 76,992 (320)
Finding Hamiltonian and Longest (s,t)-Paths of C-Shaped Supergrid Graphs in Linear Time
Algorithms, 2022 A graph is called Hamiltonian connected if it contains a Hamiltonian path between any two distinct vertices. In the past, we proved the Hamiltonian path and cycle problems for general supergrid graphs to be NP-complete.
Fatemeh Keshavarz-Kohjerdi, Ruo-Wei Hung
doaj +1 more source
Hamiltonian Cycle Problem in Strong k-Quasi-Transitive Digraphs With Large Diameter
Discussiones Mathematicae Graph Theory, 2021 Let k be an integer with k ≥ 2. A digraph is k-quasi-transitive, if for any path x0x1... xk of length k, x0 and xk are adjacent. Let D be a strong k-quasi-transitive digraph with even k ≥ 4 and diameter at least k +2.
Wang Ruixia
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.
Tudor Zamfirescu, John R. Reay
openaire +3 more sources
Discrete Mathematics, 2022 If the line graph of a graph $G$ decomposes into Hamiltonian cycles, what is $G$? We answer this question for decomposition into two cycles.
Vaidy Sivaraman, Thomas Zaslavsky
openaire +2 more sources
Hamiltonian paths and cycles in hypertournaments [PDF]
Journal of Graph Theory, 1997 If \(n\) and \(k\) are integers, \(n \geq k > 1\), a \(k\)-hypertournament \(T\) on \(n\) vertices consists of a set \(V\) of vertices, where \(|V|= n\), and a set \(A\) of \(k\)-tuples (``arcs'') of vertices such that for any \(k\)-subset \(S\) of \(V\), \(A\) contains exactly one of the \(k\)! \(k\)-tuples whose entries belong to \(S\). Note that a 2-
Gutin, Gregory, Yeo, A.
openaire +11 more sources
On Extremal Hypergraphs for Hamiltonian Cycles [PDF]
Electronic Notes in Discrete Mathematics, 2011 We study sufficient conditions for Hamiltonian cycles in hypergraphs, and obtain both Tur n- and Dirac-type results. While the Tur n-type result gives an exact threshold for the appearance of a Hamiltonian cycle in a hypergraph depending only on the extremal number of a certain path, the Dirac-type result yields a sufficient condition relying solely ...
Wilma Weps, Roman Glebov, Yury Person
openaire +4 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
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
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