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
β¦ LIBER β¦
An Extension of a Theorem on Gambling Systems
β Scribed by W. Liu; Z.Z. Wang
- Publisher
- Elsevier Science
- Year
- 1995
- Tongue
- English
- Weight
- 212 KB
- Volume
- 55
- Category
- Article
- ISSN
- 0047-259X
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
An extension of Vizing's theorem
β
Chew, K. H.
π
Article
π
1997
π
John Wiley and Sons
π
English
β 110 KB
An Extension of a Theorem on Endomorphis
β
J.L. GarcΔ±́a; L. MarΔ±́n
π
Article
π
1996
π
Elsevier Science
π
English
β 115 KB
Theorem on Non-simultaneityβExtension to
β
Alladi Ramakrishnan
π
Article
π
1997
π
Elsevier Science
π
English
β 96 KB
An Extension of E. Bishop's Localization
β
A.A Danielyan; E.B Saff
π
Article
π
2001
π
Elsevier Science
π
English
β 106 KB
Extension of a theorem of mason
β
Harold N. Shapiro; Gerson H. Sparer
π
Article
π
1994
π
John Wiley and Sons
π
English
β 243 KB
Extension of Toyoda's theorem on entropi
β
Vladimir Volenec
π
Article
π
1981
π
John Wiley and Sons
π
English
β 281 KB
## 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