T-Periodic Solutions of Time Dependent Hamiltonian Systems with a Potential Vanishing at Infinity.
Klaus Thews (1980/81)
Manuscripta mathematica
Similarity:
Klaus Thews (1980/81)
Manuscripta mathematica
Similarity:
Patricio L. Felmer (1990)
Manuscripta mathematica
Similarity:
Maria Letizia Bertotti (1989)
Manuscripta mathematica
Similarity:
Zhu Daxin (1991)
Manuscripta mathematica
Similarity:
Boris Khesin (1993)
Recherche Coopérative sur Programme n°25
Similarity:
E. Zenhder (1975)
Publications mathématiques et informatique de Rennes
Similarity:
Antonio Ambrosetti, V. Coti Zelati (1989)
Mathematische Zeitschrift
Similarity:
Gary Chartrand, S. F. Kapoor (1974)
Colloquium Mathematicae
Similarity:
Ginzburg, Viktor L., Gürel, Basak Z. (2002)
Electronic Research Announcements of the American Mathematical Society [electronic only]
Similarity:
M. Timoumi, A. Trad (1995)
Collectanea Mathematica
Similarity:
Vittorio Coti Zelati, Ivar Ekeland, Eric Séré (1990)
Mathematische Annalen
Similarity:
Yiming Long (1990)
Mathematische Zeitschrift
Similarity:
Jens-P. Bode, Anika Fricke, Arnfried Kemnitz (2015)
Discussiones Mathematicae Graph Theory
Similarity:
In 1980 Bondy [2] proved that a (k+s)-connected graph of order n ≥ 3 is traceable (s = −1) or Hamiltonian (s = 0) or Hamiltonian-connected (s = 1) if the degree sum of every set of k+1 pairwise nonadjacent vertices is at least ((k+1)(n+s−1)+1)/2. It is shown in [1] that one can allow exceptional (k+ 1)-sets violating this condition and still implying the considered Hamiltonian property. In this note we generalize this result for s = −1 and s = 0 and graphs that fulfill a certain connectivity...
A. Katok, D. Bernstein (1987)
Inventiones mathematicae
Similarity: