𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Strong sufficient conditions for the existence of Hamiltonian circuits in undirected graphs

✍ Scribed by Ahmed Ainouche; Nicos Christofides

Publisher
Elsevier Science
Year
1981
Tongue
English
Weight
225 KB
Volume
31
Category
Article
ISSN
0095-8956

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Limit distribution for the existence of
Limit distribution for the existence of hamiltonian cycles in a random graph
✍ JΓ‘nos KomlΓ³s; Endre SzemerΓ©di πŸ“‚ Article πŸ“… 1983 πŸ› Elsevier Science 🌐 English βš– 874 KB

P&a proved that a random graph with clt log n edges is Hamiltonian with probability tending to 1 if c >3. Korsunov improved this by showing that, if Gn is a random graph with \*n log n + in log log n + f(n)n edges and f(n) --\*m, then G" is Hamiltonian, with probability tending to 1. We shall prove

Sufficient conditions for the existence
Sufficient conditions for the existence of bound states in a potential without spherical symmetry
✍ K Chadan; Ch De Mol πŸ“‚ Article πŸ“… 1980 πŸ› Elsevier Science 🌐 English βš– 662 KB

We give in this paper several sufficient conditions for the existence of negative energy bound states in a purely 'attractive potential without spherical symmetry. These conditions generalize the condition obtained recently by K. Chadan and A. Martin (C. R. Acad. Sci. Paris 290 (1980), 151), and can

A Degree Sum Condition for the Existence
A Degree Sum Condition for the Existence of a Contractible Edge in a ΞΊ-Connected Graph
✍ Matthias Kriesell πŸ“‚ Article πŸ“… 2001 πŸ› Elsevier Science 🌐 English βš– 184 KB

It is known that a noncomplete }-connected graph of minimum degree of at least w 5} 4 x contains a }-contractible edge, i.e., an edge whose contraction yields again a }-connected graph. Here we prove the stronger statement that a noncomplete }-connected graph for which the sum of the degrees of any