๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Upper bound on the neutron-deuteron doublet scattering length

โœ Scribed by Larry Spruch; Leonard Rosenberg


Publisher
Elsevier Science
Year
1960
Weight
763 KB
Volume
17
Category
Article
ISSN
0029-5582

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


An upper bound on the length of a Hamilt
โœ Takao Asano; Takao Nishizeki; Takahiro Watanabe ๐Ÿ“‚ Article ๐Ÿ“… 1980 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 840 KB

## Abstract A Hamiltonian walk of a connected graph is a shortest closed walk that passes through every vertex at least once, and the length of a Hamiltonian walk is the total number of edges traversed by the walk. We show that every maximal planar graph with __p__(โ‰ฅ 3) vertices has a Hamiltonian c