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 Melnikov's theorem
โ Scribed by A.M. Davie; D.R. Wilken
- Publisher
- Elsevier Science
- Year
- 1972
- Tongue
- English
- Weight
- 208 KB
- Volume
- 11
- Category
- Article
- ISSN
- 0022-1236
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 Wagner's theorem
โ
Lynn Margaret Batten
๐
Article
๐
1991
๐
Elsevier Science
๐
English
โ 215 KB
In his famous 1965 paper, Asher Wagner proves that if S is a finite affine plane and G a collineation group line transitive on S. then S is a translation atfine plane and G contains the translation group of S. In this paper, we generalize Wagner's assumptions to: S is an affine spfce embedded as a m
An extension of Polya's Theorem
โ
A.M Fink
๐
Article
๐
1968
๐
Elsevier Science
๐
English
โ 142 KB
An extension of Schensted's theorem
โ
Curtis Greene
๐
Article
๐
1974
๐
Elsevier Science
๐
English
โ 588 KB
An extension of Knopp's core theorem
โ
B Choudhary
๐
Article
๐
1988
๐
Elsevier Science
๐
English
โ 284 KB
Extending an extension of Grinberg's the
โ
Joseph Zaks
๐
Article
๐
1982
๐
Elsevier Science
๐
English
โ 161 KB