𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the Number of Solovay r-Degrees

✍ Scribed by Douglas R. Busch

Publisher
John Wiley and Sons
Year
1976
Tongue
English
Weight
275 KB
Volume
22
Category
Article
ISSN
0044-3050

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

The number of degree restricted maps on
The number of degree restricted maps on general surfaces
✍ Zhicheng Gao πŸ“‚ Article πŸ“… 1993 πŸ› Elsevier Science 🌐 English βš– 727 KB

Let D be a finite set of positive integers with maximum bigger than two and ti,,.(rii,,.) be the number of n-edged rooted maps on the orientable (nonorientable) surface of type 9 whose face degrees (or, dually, vertex degrees) all lie in D. Define A&)= 1 ~g,&", ll>O cl,(x)= 1 fis,"X". ## Il>O We

On determining the number of stochastic
On determining the number of stochastic degrees of freedom in polyatomic molecules
✍ J.R. Stine; D.W. Noid πŸ“‚ Article πŸ“… 1983 πŸ› Elsevier Science 🌐 English βš– 376 KB

Construction of dimrnsionality plots have proved useful for determining the number of integrals of the motion in dynamical systems x\ith t\\ o and three degrees of freedom. The slow comergence in the method is caused by the trajectory not accessing phase space uniformly. Here an information dimensio

Class 1 conditions depending on the mini
Class 1 conditions depending on the minimum degree and the number of vertices of maximum degree
✍ Thomas Niessen; Lutz Volkmann πŸ“‚ Article πŸ“… 1990 πŸ› John Wiley and Sons 🌐 English βš– 694 KB

## Abstract A graph is called Class 1 if the chromatic index equals the maximum degree. We prove sufficient conditions for simple graphs to be Class 1. Using these conditions we improve results on some edge‐coloring theorems of Chetwynd and Hilton. We also improve a theorem concerning the 1‐factori