𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A new reduction rule for the connection graph proof procedure

✍ Scribed by Klaus Heje Munch


Publisher
Springer Netherlands
Year
1988
Tongue
English
Weight
880 KB
Volume
4
Category
Article
ISSN
0168-7433

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


A short proof for the Faudree-Schelp the
✍ Cai Xiao-Tao πŸ“‚ Article πŸ“… 1984 πŸ› John Wiley and Sons 🌐 English βš– 87 KB πŸ‘ 1 views

## Abstract In this note a shortened proof is given for the Faudreeβ€”Schelp theorem on path‐connected graphs.

A New Proof for a Lemma Connected with t
✍ Peter Schatte πŸ“‚ Article πŸ“… 1981 πŸ› John Wiley and Sons 🌐 English βš– 77 KB

Let X be a random variable satisfying for some z =-0. \Ye denote by P ( x ) the distribution function, by f ( t ) the characteristic function of the random variable X and introduce such that l a / -= ~/ 3 because of (1). Further, we use the denotations

A new reductive procedure for the prepar
✍ Sang-Hun Jung; Harold Kohn πŸ“‚ Article πŸ“… 1984 πŸ› Elsevier Science 🌐 French βš– 216 KB

sumnary: Selective reductive procedures for the preparation of vicinal diamines and rrpncmines fran alkyl bromxyanamides are described. The frequent occurrence of the vicinal diamine functionality (1, in important naturally occurring compounds and medicinal agents renders this group a worthy synthe