Let G = (V (G), E(G)) be a simple graph of maximum degree โ โค D such that the graph induced by vertices of degree D is either a null graph or is empty. We give an upper bound on the number of colours needed to colour a subset S of V (G) โช E(G) such that no adjacent or incident elements of S receive
Extension of a theorem of mason
โ Scribed by Harold N. Shapiro; Gerson H. Sparer
- Publisher
- John Wiley and Sons
- Year
- 1994
- Tongue
- English
- Weight
- 243 KB
- Volume
- 47
- Category
- Article
- ISSN
- 0010-3640
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
Let แ be a semisimple Lie algebra over an algebraically closed field of ร 4 characteristic zero with a root basis s โฃ , . . . , โฃ , root system โฌ, and Cartan subalgebra แ . One may associate to any non-empty subset ะ n a parabolic subalgebra แ , which is defined by the following root space
The Preiss differentiability theorem for Lipschitz functions on Banach spaces is generalized to locally lower (upper) semi-Lipschitz functions, and several extensions are presented. 1994 Academic Press, Inc.
## Extension of Toyoda's theorem on entropic groupoids By VLADIMRC VOLENEC of Zagreb (Eingegangen am 8. 10. 1980) A groupoid (a, .) is said to be entropic iff for every a, b, c, d E G the equality (1) ab cd = acbd holds true. A well-known TOYODA'S theorem ([S], [a], [21 and [l], 1). 33) asserts th