## Abstract In this paper, we show that __n__ β©Ύ 4 and if __G__ is a 2βconnected graph with 2__n__ or 2__n__β1 vertices which is regular of degree __n__β2, then __G__ is Hamiltonian if and only if __G__ is not the Petersen graph.
A class of Hamiltonian polytopes
β Scribed by P. R. Goodey
- Publisher
- John Wiley and Sons
- Year
- 1977
- Tongue
- English
- Weight
- 208 KB
- Volume
- 1
- Category
- Article
- ISSN
- 0364-9024
No coin nor oath required. For personal study only.
β¦ Synopsis
Abstract
It is shown that any simple 3βpolytope, all of whose faces are triangles or hexagons, admits a hamiltonian circuit.
π SIMILAR VOLUMES
## Abstract Using theorems of Butler, Goodey, and Okamura we show that every simple 3βpolytope of order 32 or less is Hamiltonian.
## RN \_ S Βͺ R has a unique strict global maximum at a point p g R N and a singular Under some compactness conditions on V at 1 infinity and around the singular set S we study the existence of homoclinic orbits to p which link with S. When V and G satisfy suitable geometrical conditions, we can p
## Abstract In this paper, the unboundedness of solutions for the following planar Hamilton system __Ju__ β² = β__H__ (__u__) + __h__ (__t__) is discussed, where the function __H__ (__u__) β __C__^2^(__R__^2^, __R__) is positive for __u__ β 0 and is positively (__q__, __p__)βquasihomogeneous of qu