Search
Search Results
-
The Hamiltonicity and Hamiltonian-connectivity of Solid Supergrid Graphs
The Hamiltonian path and cycle problems are well-known NP-complete problems. A given graph is Hamiltonian-connected if there exists a Hamiltonian...
-
Symplectic Geometry and Hamiltonian Dynamics
The method of pseudoholomorphic curves was introduced by Gromov [Gro85]. The equation of Gromov’s pseudoholomorphic curves is conformally invariant....
-
On traceable iterated line graph and hamiltonian path index
**ong and Liu [
21 ] gave a characterization of the graphs G for which the n -iterated line graph L n ( G ) is hamiltonian, for n ≥ 2. In this paper, we... -
Finding a Hamiltonian cycle by finding the global minimizer of a linearly constrained problem
It has been shown that a global minimizer of a smooth determinant of a matrix function corresponds to the largest cycle of a graph. When it exists,...
-
-
On Hamiltonian Property of Cayley Digraphs
Let G be a finite group generated by S and C ( G, S ) the Cayley digraphs of G with connection set S . In this paper, we give some sufficient conditions...
-
(Quasi-)Hamiltonian manifolds of cohomogeneity one
We classify compact, connected Hamiltonian and quasi-Hamiltonian manifolds of cohomogeneity one (which is the same as being multiplicity free of rank...
-
Implicit degree condition restricted to essential independent sets for Hamiltonian cycles
A cycle of a graph G is Hamiltonian if it visits every vertex of G exactly once. A graph is Hamiltonian if it has a Hamiltonian cycle. The problem of...
-
Finding a second Hamiltonian decomposition of a 4-regular multigraph by integer linear programming
A Hamiltonian decomposition of a regular graph is a partition of its edge set into Hamiltonian cycles. We consider the second Hamiltonian...
-
Approximation of Generating Function Barcode for Hamiltonian Diffeomorphisms
Persistence modules and barcodes are used in symplectic topology to define various invariants of Hamiltonian diffeomorphisms, however numerical...
-
Cuplength estimates for time-periodic measures of Hamiltonian systems with diffusion
We show how methods from Hamiltonian Floer theory can be used to establish lower bounds for the number of different time-periodic measures of...
-
-
-
A Port-Hamiltonian, Index \(\le 1\) , Structurally Amenable Electrical Circuit Formulation
We present a recently developed electrical circuit formulation that has port-Hamiltonian (pH) structure and results in a structurally amenable...
-
Hamiltonian (s, t)-paths in solid supergrid graphs
The Hamiltonian path is a well-known NP-complete problem. This problem has been studied for solid supergrid graphs, in some special cases, and...
-
Asymptotics of the Number of End Positions of a Random Walk on a Directed Hamiltonian Metric Graph
AbstractThe asymptotics of the number of end positions of a random walk on an oriented Hamiltonian metric graph is obtained.
-
The 16th Hilbert Problem for Discontinuous Piecewise Linear Hamiltonian Saddles and Isochronous Centers Separated by a Straight Line
We provide the maximum number of limit cycles for discontinuous piecewise differential systems separated by a straight line and formed by a linear...
-
Quasi-geostrophic MHD equations: Hamiltonian formulation and nonlinear stability
Magnetic fields in stars and planets are generated by a dynamo process that results from multi-scale interactions of the flows in conducting fluids....
-
Tverberg’s Theorem, Disks, and Hamiltonian Cycles
For a finite set of S points in the plane and a graph with vertices on S , consider the disks with diameters induced by the edges. We show that for...
-
Hankel Edge Ideals of Trees and (Semi-)Hamiltonian Graphs
In this paper, we study the Hankel edge ideals of graphs. We determine the minimal prime ideals of the Hankel edge ideal of labeled Hamiltonian and...
