A note concerning the collinear libration centers
✍ Scribed by André Deprit
- Publisher
- Elsevier Science
- Year
- 1965
- Tongue
- English
- Weight
- 351 KB
- Volume
- 4
- Category
- Article
- ISSN
- 0019-1035
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
We improve an upper bound for the chromatic index of a multigraph due to Andersen and Gol'dberg. As a corollary w e deduce that if no t w o edges of multiplicity at least t w o in G are adjacent, then ,y'(G) s A ( G ) + 1. In addition w e generalize results concerning the structure of critical graph
An algorithm, described by Sedgewick, finds the distance between the closest pair of n given points in a plane using a variant of mergesort. This takes O(n log n) time. To prove this it is necessary to show that, in the merge phase of the algorithm, no more than a constant number of distances need t
The stability of the collinear libration points in the photogravitational elliptical three-body problem is investigated. The distribution of the inner collinear libration points located between the principal bodies in the system is revealed. A method of finding collinear libration points for particl